Imagen de Portada

Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems

Guardado en:
Publicado en:Operations Research vol. 53, no. 4 (Jul/Aug 2005), p. 735-739
Autor principal: Edgar den Boef
Otros Autores: Korst, Jan, Martello, Silvano, Pisinger, David, Vigo, Daniele
Publicado:
Institute for Operations Research and the Management Sciences
Materias:
Optimization
Algorithms
Robots
Packing problem
Operations research
Laboratories
Resource management
Acceso en línea:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen: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]
ISSN:0030-364X
1526-5463
0096-3984
Fuente:ABI/INFORM Global