A 9-fold Partition Heuristic for Packing Boxes into a Container
In this paper we propose a simple recursive uniform algorithm for the problem of packing boxes into a container.
We are particularly concerned with the special case where all boxes are identical. The algorithm has as
input a fixed triad (an object which generalizes a plane graph) and can be specialized to recover a
previous result in dimension two by Morabito and Morales. The study has practical applications for the
problems of pallet and container loading where the number of rectangles and boxes to be loaded is small.