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...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & operations research Ročník 185; s. 107276
Hlavní autoři:	Akçay, Fatih Burak, Delorme, Maxence
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.01.2026
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!