Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14724
For citation please use:
Main Title: More-Dimensional Packing with Order Constraints
Author(s): Fekete, Sándor P.
Köhler, Ekkehard
Teich, Jürgen
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15951
http://dx.doi.org/10.14279/depositonce-14724
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We present a first systematic study on more-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture. They can be interpreted as more-dimensional generalizations of scheduling problems. Using graph-theoretic structures to describe feasible solutions, we develop a novel exact branch-and-bound algorithm. This extends previous work by Fekete and Schepers; a key tool is a new order-theoretic characterization of feasible extensions of a partial order to a given complementarity graph that is tailor-made for use in a branch-and-bound environment. The usefulness of our approach is validated by computational results.
Subject(s): scheduling
more-dimensional packing
precedence constraints
exact algorithms
interval graphs
partial orders
Issue Date: 2000
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
68R10 Graph theory
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2000, 698
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-698-2000.pdf
Format: Adobe PDF | Size: 19.97 MB
DownloadShow Preview
Thumbnail
Report-698-2000.ps.gz
Format: Unknown | Size: 199.66 kB
Download
Report-698-2000.ps
Format: Postscript | Size: 2.82 MB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.