New Lower Bounds for the Three-Dimensional Strip Packing Problem

Kirsten Hoffmann ()
Additional contact information
Kirsten Hoffmann: Fakultät Wirtschaftswissenschaften

A chapter in Operations Research Proceedings 2013, 2014, pp 201-207 from Springer

Abstract: Abstract In this paper, we study the three-dimensional strip packing problem (SPP3) which involves packing a set of non-rotatable boxes into a three-dimensional strip (container) of fixed length and width but unconstrained height. The goal is to pack all of the boxes orthogonal oriented and without overlapping into the container, minimising its resulting height. We present new lower bounds derived from different relaxations of the mathematical formulation of the SPP3. Furthermore, we show dominance relations between different bounds and limit the worst case performance ratio of some bounds.

Keywords: Lower Bound; Original Problem; Packing Problem; Performance Ratio; Strip Packing Problem (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-319-07001-8_27

Ordering information: This item can be ordered from
http://www.springer.com/9783319070018

DOI: 10.1007/978-3-319-07001-8_27

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().