Introduction to Cutting and Packing Optimization

Problems, Modeling Approaches, Solution Methods
Softcover Nachdruck of the original 1. Auflage 2018
ISBN: 978-3-319-87785-3
Verlag: Springer International Publishing

Buch, Englisch, Band 263, 410 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 657 g

Reihe: International Series in Operations Research & Management Science

This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing. Based on appropriate modeling approaches for the problems considered, it offers an introduction to the related solution methods. It also addresses aspects like performance results for heuristic algorithms and bounds of the optimal value, as well as the packability of a given set of objects within a predefined container. The problems discussed arise in a wide variety of different fields of application and research, and as such, the fundamental knowledge presented in this book make it a valuable resource for students, practitioners, and researchers who are interested in dealing with such tasks.

Zielgruppe

Graduate

Autoren/Hrsg.

Scheithauer, Guntram

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Wirtschaftswissenschaften Betriebswirtschaft Bereichsspezifisches Management Einkauf, Logistik, Supply-Chain-Management
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Wirtschaftswissenschaften Betriebswirtschaft Unternehmensforschung

Inhaltsverzeichnis

Modeling.- Knapsack Problems.- One-Dimensional Bin Packing.- One-Dimensional Cutting Stock.- Orthogonal Packing Feasibility, Two-Dimensional Knapsack Problems.- Optimal Guillotine Cutting.- Packing Rectangles into a Strip.- Two-Dimensional Bin Packing.- Quality Restrictions.- Pallet Loading.- Container Loading.- Packing of Polygonal Pieces.- Circle and Sphere Packing.

Über Autor(innen)

Guntram Scheithauer was born in Bischofswerda, Saxony, Germany in 1954. He studied Mathematics at Technische Universität Dresden from 1974 to 1979, with a focus on Numerical Mathematics and Optimization. He received his PhD in the area of Discrete Optimization from the same institute in 1983. Throughout his career, his work has focused on both practical and theoretical aspects of cutting and packing problems. He has been a member of staff at the TU Dresden since 1983.