On more-dimensional packing I: Modeling

Fekete, Sandor P. and Schepers, Jörg (2000) On more-dimensional packing I: Modeling.
Technical Report , 15 p.


More-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for practical exact algorithms have been unable to avoid structural problems that appear for packing problems in two- or higher-dimensional space. We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings. Our characterization allows it to deal with classes of packings that share a certain combinatorical structure, instead of single ones. This allows it to make it the basis for a succesful branch-and-bound framework.

Download: [img] Postscript - Updated Version
Download (300kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr97-288
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/288