Exact Solution Techniques for Two-dimensional Cutting and Packing
arXiv:2004.12619 · doi:10.1016/j.ejor.2020.06.050
Abstract
We survey the main formulations and solution methods for two-dimensional orthogonal cutting and packing problems, where both items and bins are rectangles. We focus on exact methods and relaxations for the four main problems from the literature: finding a packing with minimum height, packing the items into the minimum number of bins, finding a packing of maximum value, and determining the existence of a feasible packing.
Cited by in corpus (5)
- Operational Research: Methods and Applications
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
- Hierarchical Rectangle Packing Solved by Multi-Level Recursive Logic-based Benders Decomposition
- Enhanced Formulation for Guillotine 2D Cutting Problems