Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization

In the strip packing problem, the objective is to pack a set of two-dimensional items into a strip of fixed width such that the total height of the packing is minimized. The current state-of-the-art exact approach for the problem uses a decomposition framework in which the main problem (MP) fixes th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research Jg. 185; S. 107276
Hauptverfasser:	Akçay, Fatih Burak, Delorme, Maxence
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.01.2026
Schlagworte:	Computational experiments Decomposition approach Exact algorithm Machine-learning-based improvements Strip packing problem Strip packing problem Computational experiments Machine-learning-based improvements Exact algorithm Decomposition approach
ISSN:	0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!