Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems
复制标题
DOI：
10.1287/opre.1050.0210
复制
发表时间：
2005-07
期刊：
影响因子：
--
通讯作者：
E. D. Boef;J. Korst;S. Martello;David Pisinger;D. Vigo
中科院分区：
文献类型：
--
作者：
E. D. Boef;J. Korst;S. Martello;David Pisinger;D. Vigo
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.
