IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i4p735-736.html
   My bibliography  Save this article

Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems

Author

Listed:
  • Edgar den Boef

    (Quintiq, MJ’s-Hertogenbosch, The Netherlands)

  • Jan Korst

    (Philips Research Laboratories, Eindhoven, The Netherlands)

  • Silvano Martello

    (DEIS, University of Bologna, Bologna, Italy)

  • David Pisinger

    (DIKU, University of Copenhagen, Copenhagen, Denmark)

  • Daniele Vigo

    (DEIS, University of Bologna, Bologna, Italy)

Abstract

In the three-dimensional bin packing problem the task is to orthogonally pack a given set of rectangular items into a minimum number of three-dimensional rectangular bins. We give a characterization of the algorithm proposed by Martello et al. (2000) for the exact solution of the problem, showing that not all orthogonal packings can be generated by the proposed algorithm. The packings, however, have the property of being robot packings, which is relevant in practical settings. References to the modified algorithm, which solves the orthogonal as well as robot packable three-dimensional problem, are given.

Suggested Citation

  • Edgar den Boef & Jan Korst & Silvano Martello & David Pisinger & Daniele Vigo, 2005. "Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems," Operations Research, INFORMS, vol. 53(4), pages 735-736, August.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:4:p:735-736
    DOI: 10.1287/opre.1050.0210
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1050.0210
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1050.0210?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
    ---><---

    Citations

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


    Cited by:

    1. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.
    2. F. Parreño & R. Alvarez-Valdes & J. Oliveira & J. Tamarit, 2010. "A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing," Annals of Operations Research, Springer, vol. 179(1), pages 203-220, September.
    3. Teodor Gabriel Crainic & Guido Perboli & Roberto Tadei, 2008. "Extreme Point-Based Heuristics for Three-Dimensional Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 368-384, August.

    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:inm:oropre:v:53:y:2005:i:4:p:735-736. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.