# Exact Solution Techniques for Two-dimensional Cutting and Packing

arXiv: https://arxiv.org/abs/2004.12619 · HTML: https://mlsanity.com/paper/2004.12619/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Apr 2020.

## Built on by (most cited first, 3 of 3)

- [Planning Irregular Object Packing via Hierarchical Reinforcement Learning](https://mlsanity.com/paper/2211.09382/) (2022)
- [Towards Automatic Design of Factorio Blueprints](https://mlsanity.com/paper/2310.01505/) (2023)
- [A Neural Column Generation Approach to the Vehicle Routing Problem with Two-Dimensional Loading and Last-In-First-Out Constraints](https://mlsanity.com/paper/2406.12454/) (2024)

## Abstract (arXiv)

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.