This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by den Boef, E. Articles by Vigo, D. Search for Related Content

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

Quintiq, MJ’s-Hertogenbosch, The Netherlands
Philips Research Laboratories, Eindhoven, The Netherlands
DEIS, University of Bologna, Bologna, Italy
DIKU, University of Copenhagen, Copenhagen, Denmark
DEIS, University of Bologna, Bologna, Italy
edgar.den.boef{at}quintiq.com
jan.korst#x0040;philips.com
smartello#x0040;deis.unibo.it
pisinger#x0040;diku.dk
dvigo#x0040;deis.unibo.it

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.

Subject classifications: programming:integer algorithms; production/scheduling:cutting stock/trim.
History: Received January 2002; revision received June 2004; revision received July 2004; accepted July 2004.

This article has been cited by other articles:

				T. G. Crainic, G. Perboli, and R. Tadei Extreme Point-Based Heuristics for Three-Dimensional Bin Packing INFORMS Journal on Computing, June 1, 2008; 20(3): 368 - 384. [Abstract] [PDF]

				M. Iori, J.-J. Salazar-Gonzalez, and D. Vigo An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints Transportation Science, May 1, 2007; 41(2): 253 - 264. [Abstract] [PDF]