An exact algorithm for higher-dimensional orthogonal packing

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fekete, Sandor P, Schepers, Joerg, van der Veen, Jan C
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!