Für diesen Artikel ist leider kein Bild verfügbar.

Probabilistic Analysis of Packing and Partitioning Algorithms

Buch | Hardcover
192 Seiten
1991
John Wiley & Sons Inc (Verlag)
978-0-471-53272-9 (ISBN)
152,80 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
Provides an examination of two important classes that are characteristic of combinatorial optimization problems: sequencing and scheduling, and packing and partitioning. These classes of problems are shown to encompass a range of practical applications, such as production planning and VLSI design.
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.

Analysis Techniques. Matching Problems. Scheduling and Partitioning. Bin Packing: The Optimum Solution. Bin Packing: Heuristics. Packings in Two Dimensions. References. Index.

Erscheint lt. Verlag 30.5.1991
Zusatzinfo Ill.
Verlagsort New York
Sprache englisch
Maße 42 x 60 mm
Gewicht 482 g
Themenwelt Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-471-53272-X / 047153272X
ISBN-13 978-0-471-53272-9 / 9780471532729
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich