Cutting and packing optimization. Problems modeling and solution methods.

zbMath1144.90001MaRDI QIDQ931915

Guntram Scheithauer

Publication date: 7 July 2008

Published in: Studienbücher Wirtschaftsmathematik (Search for Journal in Brave)

zbMATH Keywords

cutting problemsbin packing problemapproximation algorithmssolution algorithmsPacking problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (10)

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons ⋮ Integer linear programming models for the skiving stock problem ⋮ An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling ⋮ Cutting and Packing Problems with Placement Constraints ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Integer rounding and modified integer rounding for the skiving stock problem ⋮ On packing \(\mathbb R^3\) with thin tori ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case

This page was built for publication: Cutting and packing optimization. Problems modeling and solution methods.