Login per gli autori
Lodi, Andrea ; Martello, Silvano ; Vigo, Daniele
(2004)
Models and bounds for two-dimensional level packing problems.
Journal of Combinatorial Optimization, 8
(3).
pp. 363-379.
ISSN 1382-6905
Full text disponibile come:
Anteprima |
Documento PDF
Licenza: Creative Commons Attribution Non-commercial 3.0 (CC BY-NC 3.0) Download (186kB) | Anteprima |
URL ufficiale: http://www.springerlink.com/media/dlycm7yxyrdryvxuueet/contributions/r/7/0/l/r70l5m3629321661.pdf
Abstract
We consider two-dimensional bin packing and strip packing problems where the items have to be packed by levels. We introduce new mathematical models involving a polynomial number of variables and constraints, and show that their LP relaxations dominate the standard area relaxations. We then propose new (combinatorial) bounds that can be computed in O(nlog n) time. We show that they dominate the other bounds, and establish their absolute worst-case behavior. The quality of models and bounds is evaluated through extensive computational experiments
Abstract
Altri metadati
Statistica sui download
Statistica sui download
Gestione del documento:
