E. G. Coffman, George S. Lueker, "Probabilistic Analysis of Packing and Partitioning Algorithms"
1991 | pages: 202 | ISBN: 047153272X | DJVU | 1,7 mb
1991 | pages: 202 | ISBN: 047153272X | DJVU | 1,7 mb
This volume examines two important classes that are characteristic of combinatorial optimization problems: sequencing and scheduling (in which a set of objects has to be ordered subject to a number of conditions), and packing and partitioning (in which a set of objects has to be split into subsets in order to meet a certain objective). These classes of problems encompass a wide range of practical applications, from production planning and flexible manufacturing to computer scheduling and VLSI design.
My Links