The three-dimensional bin packing problem: Robot-packable and orthogonal variants of packing problems (vol 53, pg 735, 2005)
成果类型：
Correction
署名作者：
den Boef, E; Korst, J; Martello, S; Pisinger, D; Vigo, D
署名单位：
Philips; Philips Research; University of Bologna; University of Copenhagen
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1050.0210
发表日期：
2005
页码：
735-736
关键词：
摘要：
In the three-dimensional bin packing problem the task is to orthogotnally 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.