A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

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. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an optimal solution. Previous efforts have produced a number of special classes of such bounds. Unfortunately, some of these bounds are somewhat complicated and hard to generalize. We present a new approach for obtaining classes of lower bounds for higher-dimensional packing problems; our bounds improve and simplify several well-known bounds from previous literature. In addition, our approach provides an easy framework for proving correctness of new bounds.
16 pages, 4 figures, Latex, to appear in Mathematical Methods of Operations Research

Keywords

Data Structures and Algorithms, Computational Geometry, F.2.2

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv