Cutting and Packing Problems
From the Perspective of Combinatorial Optimization
Seiten
2025
|
1st ed. 2025
Springer Verlag, Japan
978-4-431-55290-1 (ISBN)
Springer Verlag, Japan
978-4-431-55290-1 (ISBN)
- Noch nicht erschienen - erscheint am 11.09.2025
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
This book provides a comprehensive overview of practical cutting and packing problems, presenting practical algorithms for solving these problems from the perspective of combinatorial optimization. It also discusses the geometric properties and tools for cutting and packing problems.
Problems of cutting and packing objects have been extensively studied for many years because of the numerous real-world applications—for instance, in the clothing, logistics, manufacturing, and material industries. They can be classified in three ways according to their dimensions: The one-dimensional problem is the most basic category of problems including knapsack problems, bin packing problems, and cutting stock problems. The two-dimensional geometric problems include rectangle packing problems, circle packing problems, and polygon packing problems. The three-dimensional problem is the most difficult category and has applications in container loading, cargo and warehouse management and so forth. Most of these variants are NP-hard, since they contain as a special case the knapsack problem or the bin packing problem, which are already known to be NP-hard. Therefore, heuristics and metaheuristics are essential for designing practical algorithms for these problems. In addition to practical algorithms for solving a wide variety of cutting and packing problems, the book also considers another feature of cutting and packing problems: the need to develop powerful geometric tools to handle the wide variety and complexity of shapes that need to be packed.
Problems of cutting and packing objects have been extensively studied for many years because of the numerous real-world applications—for instance, in the clothing, logistics, manufacturing, and material industries. They can be classified in three ways according to their dimensions: The one-dimensional problem is the most basic category of problems including knapsack problems, bin packing problems, and cutting stock problems. The two-dimensional geometric problems include rectangle packing problems, circle packing problems, and polygon packing problems. The three-dimensional problem is the most difficult category and has applications in container loading, cargo and warehouse management and so forth. Most of these variants are NP-hard, since they contain as a special case the knapsack problem or the bin packing problem, which are already known to be NP-hard. Therefore, heuristics and metaheuristics are essential for designing practical algorithms for these problems. In addition to practical algorithms for solving a wide variety of cutting and packing problems, the book also considers another feature of cutting and packing problems: the need to develop powerful geometric tools to handle the wide variety and complexity of shapes that need to be packed.
1 Typology of Cutting and Packing Problems.- 2 Preliminary.- 3 One-dimensional Cutting Stock Problem.- 4 Rectangle Packing Problem.- 5 Polygon Packing Problem.- 6 Container Loading Problem.- 7 Other Packing Problems.
| Erscheint lt. Verlag | 11.9.2025 |
|---|---|
| Zusatzinfo | 100 Illustrations, black and white; IV, 300 p. 100 illus. |
| Verlagsort | Tokyo |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| Wirtschaft ► Allgemeines / Lexika | |
| Wirtschaft ► Betriebswirtschaft / Management ► Logistik / Produktion | |
| Wirtschaft ► Betriebswirtschaft / Management ► Marketing / Vertrieb | |
| Wirtschaft ► Betriebswirtschaft / Management ► Unternehmensführung / Management | |
| Schlagworte | Bin Packing • container loading • cutting and packing • cutting stock • irregular packing • rectangle packing |
| ISBN-10 | 4-431-55290-1 / 4431552901 |
| ISBN-13 | 978-4-431-55290-1 / 9784431552901 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
