Introduction to Cutting and Packing Optimization

Introduces the fundamental knowledge for dealing with cutting and packing problems
Presents novel modeling and solution approaches for the first time
Includes numerous exercises and solutions to deepen the acquired knowledge

Autorentext
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.

Inhalt
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.