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

Edgar den Boef (), Jan Korst (), Silvano Martello (), David Pisinger () and Daniele Vigo ()
Additional contact information
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

Operations Research, 2005, vol. 53, issue 4, 735-736

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.

Keywords: programming:integer algorithms; production/scheduling:cutting stock/trim (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1050.0210 (application/pdf)

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:inm:oropre:v:53:y:2005:i:4:p:735-736

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().