One-Dimensional Bin Packing

Guntram Scheithauer
Additional contact information
Guntram Scheithauer: TU Dresden

Chapter Chapter 3 in Introduction to Cutting and Packing Optimization, 2018, pp 47-72 from Springer

Abstract: Abstract The one-dimensional bin packing problem (1BPP) is one of the most famous problems in combinatorial optimization. The 1BPP is closely related to the one-dimensional cutting stock problem (1CSP) in terms of modeling, however, both problems possess their particularities, especially with respect to solution methods. Therefore, we will consider the 1CSP in another chapter to address the problem specific issues more properly. The BPP is known to be NP-hard. For that reason, we will consider, besides exact solution approaches, lower and upper bounds for the optimal value as well as reduction methods and some extensions.

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_3

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

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

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 ().