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.
Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems / den Boef Edgar; Korst Jan; Martello Silvano; Pisinger David; Vigo Daniele. - In: OPERATIONS RESEARCH. - ISSN 0030-364X. - STAMPA. - 53:(2005), pp. 735-736. [10.1287/opre.1050.0210]
Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
MARTELLO, SILVANO;VIGO, DANIELE
2005
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
