Content area
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. [PUBLICATION ABSTRACT]
Details
Key topics Powered by Web of Science® Description for Powered by Web of Science
Subject
Business indexing term
Classification
Title
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems
Operations Research; Linthicum
Volume
53
Issue
4
Pages
735-736
Number of pages
5
Publication year
2005
Publication date
Jul/Aug 2005
Section
ERRATUM
Place of publication
Linthicum
Country of publication
United States
Publication subject
ISSN
0030364X
e-ISSN
15265463
CODEN
OPREAI
Source type
Scholarly Journal
Language of publication
English
Document type
General Information
Document feature
references; tables; diagrams
ProQuest document ID
219154066
Document URL
https://www.proquest.com/scholarly-journals/erratum-three-dimensional-bin-packing-problem/docview/219154066/se-2?accountid=208611
Copyright
Copyright Institute for Operations Research and the Management Sciences Jul/Aug 2005
Last updated
2024-11-19
Database
ProQuest One Academic