An exact algorithm for higher-dimensional orthogonal packing

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two--dimensional test problems from recent literature. This is the third in a series of articles describing new approaches to higher-dimensional packing; see cs.DS/0310032 and cs.DS/0402044.
31 pages, 6 figures, 9 tables, to appear in Operations Research; full and updated journal version of sketches that appeared as parts of an extended abstract in ESA'97

Keywords

Data Structures and Algorithms, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/111033

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0604045
 http://arxiv.org/abs/cs/0604045

Collections

arXiv