Models and Bounds for Two-Dimensional Level Packing Problems

Andrea Lodi (), Silvano Martello () and Daniele Vigo ()
Additional contact information
Andrea Lodi: University of Bologna
Silvano Martello: University of Bologna
Daniele Vigo: University of Bologna

Journal of Combinatorial Optimization, 2004, vol. 8, issue 3, No 7, 363-379

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

Keywords: packing; cutting; ILP models (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000038915.62826.79 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038915.62826.79

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000038915.62826.79

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().