Packing small boxes into a big box

Manfred Padberg

Mathematical Methods of Operations Research, 2000, vol. 52, issue 1, 21 pages

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. Copyright Springer-Verlag Berlin Heidelberg 2000

Keywords: Key words: Three-dimensional packing; mixed-integer programming; polyhedral combinatorics; cutting planes; facets of polyhedra (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860000066 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:52:y:2000:i:1:p:1-21

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860000066

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().