Exact algorithms for the two-dimensional strip packing problem with and without rotations

We propose exact algorithms for the two-dimensional strip packing problem (2SP) with and without 90° rotations. We first focus on the perfect packing problem (PP), which is a special case of 2SP, wherein all given rectangles are required to be packed without wasted space, and design branch-and-bound...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 2009-10, Vol.198 (1), p.73-83
Hauptverfasser:	Kenmochi, Mitsutoshi, Imamichi, Takashi, Nonobe, Koji, Yagiura, Mutsunori, Nagamochi, Hiroshi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Branch & bound algorithms Branch-and-bound Branch-and-bound Combinatorial optimization Strip packing Rectangles Two-dimension Combinatorial optimization Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Optimization algorithms Packing problem Rectangles Strip packing Studies Two-dimension
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!