Probabilistic Analysis of Packing and Partitioning Algorithms (Wiley-Interscience Series in Discrete Mathematics and Optimization)

By E.G. Coffman and George S. Lueker

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

• Format: Paperback
• Language: English
• ISBN: 047153272X
• ISBN13: 9780471532729
• Release Date: April 1991
• Publisher: Wiley-Interscience
• Length: 192 Pages
• Weight: 0.51 lbs.
• Dimensions: 2.4" x 0.8" x 1.6"