Modeling of packing problems

DOI10.1080/02331939308843904zbMath0818.90083OpenAlexW2055582251MaRDI QIDQ3835624

Guntram Scheithauer, Johannes Terno

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843904

zbMATH Keywords

hodographcuttingpacking problemscutting stockallocation problemspacking of polygons

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (12)

A population heuristic for constrained two-dimensional non-guillotine cutting ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ A tabu search algorithm for a two-dimensional non-guillotine cutting problem ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem ⋮ Solution approaches to irregular nesting problems ⋮ A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ The solution of packing problems with pieces variable length and additional allocation constraints ⋮ Characterization and modelling of guillotine constraints ⋮ Irregular packing problems: a review of mathematical models

Cites Work

• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Polygon containment under translation

This page was built for publication: Modeling of packing problems