Bin packing and cutting stock problems: Mathematical models and exact algorithms

Maxence Delorme, Manuel Iori and Silvano Martello

European Journal of Operational Research, 2016, vol. 255, issue 1, 1-20

Abstract: We review the most important mathematical models and algorithms developed for the exact solution of the one-dimensional bin packing and cutting stock problems, and experimentally evaluate, on state-of-the art computers, the performance of the main available software tools.

Keywords: Bin packing; Cutting stock; Exact algorithms; Computational evaluation (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (66)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716302491
Full text for ScienceDirect subscribers only

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:eee:ejores:v:255:y:2016:i:1:p:1-20

DOI: 10.1016/j.ejor.2016.04.030

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().