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...
Saved in:
| Published in: | Computers & operations research Vol. 185; p. 107276 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.01.2026
|
| Subjects: | |
| ISSN: | 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!