We consider the problem of orthogonally packing a given set of rectangular items into a given strip, by minimizing the overall height of the packing. The problem is NP-hard in the strong sense, and finds several applications in cutting and packing. We propose a new relaxation that produces good lower bounds and gives information to obtain effective heuristic algorithms. These results are used in a branch-and-bound algorithm, which was able to solve test instances from the literature involving up to 200 items.
Martello S., Monaci M., Vigo D. (2003). An exact approach to the strip-packing problem. INFORMS JOURNAL ON COMPUTING, 15(3), 310-319 [10.1287/ijoc.15.3.310.16082].
An exact approach to the strip-packing problem
Martello S.
Primo
Membro del Collaboration Group
;Monaci M.Secondo
Membro del Collaboration Group
;Vigo D.
Ultimo
Membro del Collaboration Group
2003
Abstract
We consider the problem of orthogonally packing a given set of rectangular items into a given strip, by minimizing the overall height of the packing. The problem is NP-hard in the strong sense, and finds several applications in cutting and packing. We propose a new relaxation that produces good lower bounds and gives information to obtain effective heuristic algorithms. These results are used in a branch-and-bound algorithm, which was able to solve test instances from the literature involving up to 200 items.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
