Name
Title | ||
|---|---|---|
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems |
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1287/opre.1050.0210 | Operations Research |
Keywords | Field | DocType |
modified algorithm,orthogonal packing,minimum number,proposed algorithm,three-dimensional rectangular bin,three-dimensional bin packing problem,rectangular item,exact solution,robot packing,orthogonal variants,robot packable three-dimensional problem,packing problems,bin packing problem,three dimensional,production scheduling | Exact solutions in general relativity,Mathematical optimization,Packing problems,Cutting stock problem,Set packing,Robot,Bin packing problem,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
53 | 4 | 0030-364X |
Citations | PageRank | References |
18 | 1.13 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edgar Den Boef | 1 | 55 | 4.45 |
| Jan Korst | 2 | 175 | 19.94 |
| Silvano Martello | 3 | 2362 | 218.73 |
| David Pisinger | 4 | 2454 | 148.80 |
| Daniele Vigo | 5 | 2054 | 149.20 |