Exact Solution Techniques for Two-dimensional Cutting and Packing
Optimization and Control
2020-07-28 v1 Combinatorics
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.
Cite
@article{arxiv.2004.12619,
title = {Exact Solution Techniques for Two-dimensional Cutting and Packing},
author = {Manuel Iori and Vinícius L. de Lima and Silvano Martello and Flávio K. Miyazawa and Michele Monaci},
journal= {arXiv preprint arXiv:2004.12619},
year = {2020}
}