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

Maxence Delorme; Manuel Iori; Silvano Martello

doi:10.1016/j.ejor.2016.04.030

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

Maxence Delorme, Manuel Iori, Silvano Martello^*

^*Corresponding author for this work

Research output: Contribution to journal › Review article › peer-review

255 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1-20
Number of pages	20
Journal	European Journal of Operational Research
Volume	255
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2016.04.030
Publication status	Published - 16 Nov 2016
Externally published	Yes

Keywords

Bin packing
Computational evaluation
Cutting stock
Exact algorithms

Access to Document

10.1016/j.ejor.2016.04.030

Cite this

@article{1564e763f3bb45388f363ae31399afc4,

title = "Bin packing and cutting stock problems: Mathematical models and exact algorithms",

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, Computational evaluation, Cutting stock, Exact algorithms",

author = "Maxence Delorme and Manuel Iori and Silvano Martello",

year = "2016",

month = nov,

day = "16",

doi = "10.1016/j.ejor.2016.04.030",

language = "English",

volume = "255",

pages = "1--20",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier Science BV",

number = "1",

}

TY - JOUR

T1 - Bin packing and cutting stock problems

T2 - Mathematical models and exact algorithms

AU - Delorme, Maxence

AU - Iori, Manuel

AU - Martello, Silvano

PY - 2016/11/16

Y1 - 2016/11/16

N2 - 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.

AB - 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.

KW - Bin packing

KW - Computational evaluation

KW - Cutting stock

KW - Exact algorithms

UR - http://www.scopus.com/inward/record.url?scp=84969922963&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2016.04.030

DO - 10.1016/j.ejor.2016.04.030

M3 - Review article

AN - SCOPUS:84969922963

SN - 0377-2217

VL - 255

SP - 1

EP - 20

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this