Abstract.
The three-dimensional orthogonal packing problem consists of filling a big rectangular box with as many small rectangular boxes as possible. In a recent paper G. Fasano (Alenia Aerospazio, Turin) has given a mixed-integer programming formulation of this problem. Here we extend Fasano's formulation and subject it to polyhedral analysis. The result is a more general formulation whose linear programming relaxation is a tighter approximation of the convex hull of the mixed-integer solutions to the problem than the original model.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: August 1999/Final version received: March 2000
Rights and permissions
About this article
Cite this article
Padberg, M. Packing small boxes into a big box. Mathematical Methods of OR 52, 1–21 (2000). https://doi.org/10.1007/s001860000066
Issue Date:
DOI: https://doi.org/10.1007/s001860000066