Probabilistic analysis of packing and partitioning algorithms
Author(s)
Bibliographic Information
Probabilistic analysis of packing and partitioning algorithms
（Wiley-Interscience series in discrete mathematics and optimization）
Wiley, c1991
Available at / 37 libraries
-
No Libraries matched.
- Remove all filters.
Note
"A Wiley-Interscience publication" -- T.p
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
Analysis Techniques. Matching Problems. Scheduling and Partitioning. Bin Packing: The Optimum Solution. Bin Packing: Heuristics. Packings in Two Dimensions. References. Index.
by "Nielsen BookData"