Two-Dimensional Bin Packing

Guntram Scheithauer
Additional contact information
Guntram Scheithauer: TU Dresden

Chapter Chapter 8 in Introduction to Cutting and Packing Optimization, 2018, pp 227-244 from Springer

Abstract: Abstract The two-dimensional bin packing problem (2BPP) occurs in different variants in important real-world applications such as glass, paper, and steel cutting. A set of two-dimensional, differently sized, rectangular items is given. They have to be packed into (or cut out of) the minimum number of identical, rectangular bins. Since the one-dimensional BPP is known to be NP-hard, the 2BPP is an NP-hard optimization problem, too. After modeling the non-guillotine, the two-stage, and the three-stage guillotine case, we present some basic results, collect lower bounds, and address heuristic approaches.

Keywords: Rectangular Items; Important Real-world Applications; Lower Bound; Dual Feasible Functions; Guillotine Patterns (search for similar items in EconPapers)
Date: 2018
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:isochp:978-3-319-64403-5_8

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

DOI: 10.1007/978-3-319-64403-5_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().