IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v52y2000i1p1-21.html
   My bibliography  Save this article

Packing small boxes into a big box

Author

Listed:
  • Manfred Padberg

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

Suggested Citation

  • Manfred Padberg, 2000. "Packing small boxes into a big box," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(1), pages 1-21, September.
    • Handle: RePEc:spr:mathme:v:52:y:2000:i:1:p:1-21
    DOI: 10.1007/s001860000066
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000066
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000066?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sam D. Allen & Edmund K. Burke, 2012. "Data Structures for Higher-Dimensional Rectilinear Packing," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 457-470, August.
    2. Sándor P. Fekete & Jörg Schepers & Jan C. van der Veen, 2007. "An Exact Algorithm for Higher-Dimensional Orthogonal Packing," Operations Research, INFORMS, vol. 55(3), pages 569-587, June.
    3. Xiangling Zhao & Yun Dong & Lei Zuo, 2023. "A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading," Mathematics, MDPI, vol. 11(13), pages 1-16, June.
    4. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    5. David Pisinger & Mikkel Sigurd, 2007. "Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 36-51, February.
    6. Sándor P. Fekete & Jörg Schepers, 2004. "A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 353-368, May.
    7. Galrão Ramos, A. & Oliveira, José F. & Gonçalves, José F. & Lopes, Manuel P., 2016. "A container loading algorithm with static mechanical equilibrium stability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 565-581.
    8. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    9. Araya, Ignacio & Moyano, Mauricio & Sanchez, Cristobal, 2020. "A beam search algorithm for the biobjective container loading problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 417-431.
    10. Baldacci, Roberto & Boschetti, Marco A., 2007. "A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1136-1149, December.
    11. Lorenzo Brunetta & Philippe Grégoire, 2005. "A General Purpose Algorithm for Three-Dimensional Packing," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 328-338, August.
    12. Mateus Martin & Horacio Hideki Yanasse & Maristela O. Santos & Reinaldo Morabito, 2024. "Models for two-dimensional bin packing problems with customer order spread," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-27, August.
    13. Gleb Belov & Heide Rohling, 2013. "LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility," Operations Research, INFORMS, vol. 61(2), pages 483-497, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:52:y:2000:i:1:p:1-21. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.