On more-dimensional packing II: Bounds

Fekete, Sandor P. and Schepers, Jörg (2000) On more-dimensional packing II: Bounds.
Technical Report , 20 p.

Abstract

More-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 lower 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 more-dimensional packing problems; our bounds improve and simplify on several well-known bounds from previous literature. In addition, our approach provide an easy framework for proving correctness of new bounds.


Actions:
Download: [img] Postscript - Updated Version
Download (350kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr97-289
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 19 Dec 2011 09:46
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/289