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

Simple item page
dc.creatorFekete, Sandor P.
dc.creatorSchepers, Joerg
dc.date2004-02-18
dc.date.accessioned2026-07-07T03:20:55Z
dc.date.available2026-07-07T03:20:55Z
dc.descriptionHigher-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.
dc.description16 pages, 4 figures, Latex, to appear in Mathematical Methods of Operations Research
dc.identifierhttps://arxiv.org/abs/cs/0402044
dc.identifierhttp://arxiv.org/abs/cs/0402044
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32007
dc.subjectData Structures and Algorithms
dc.subjectComputational Geometry
dc.subjectF.2.2
dc.titleA General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
dc.typetext

Files

Collections

arXiv