Bin packing and cutting stock problems: Mathematical models and exact algorithms
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 …
solution of the one-dimensional bin packing and cutting stock problems, and experimentally …
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
In this paper, a new branch-and-price-and-cut algorithm is proposed to solve the one-
dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental …
dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental …
One-dimensional heuristics adapted for two-dimensional rectangular strip packing
G Belov, G Scheithauer… - Journal of the Operational …, 2008 - Taylor & Francis
We consider two-dimensional rectangular strip packing without rotation of items and without
the guillotine cutting constraint. We propose two iterative heuristics. The first one, SVC …
the guillotine cutting constraint. We propose two iterative heuristics. The first one, SVC …
Solving robust bin-packing problems with a branch-and-price approach
One-dimensional bin-packing is a well-known combinatorial optimization problem which is
strongly NP-hard. It consists of allocating a given set of items of different sizes into bins of the …
strongly NP-hard. It consists of allocating a given set of items of different sizes into bins of the …
An exact algorithm for the two-dimensional strip-packing problem
This paper considers the two-dimensional strip-packing problem (2SP) in which a set of
rectangular items have to be orthogonally packed, without overlap**, into a strip of a given …
rectangular items have to be orthogonally packed, without overlap**, into a strip of a given …
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
G Scheithauer, J Terno, A Müller… - Journal of the Operational …, 2001 - Taylor & Francis
When solving the one-dimensional cutting stock problem (1D CSP) as an integer linear
programming problem one has to overcome computational difficulties arising from the …
programming problem one has to overcome computational difficulties arising from the …
Parallelized sequential value correction procedure for the one-dimensional cutting stock problem with multiple stock lengths
YP Cui, TB Tang - Engineering Optimization, 2014 - Taylor & Francis
A heuristic approach with parallel computation is presented for the one-dimensional cutting
stock problem with multiple stock lengths. The algorithm is based on the sequential heuristic …
stock problem with multiple stock lengths. The algorithm is based on the sequential heuristic …
Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
Q Chen, Y Cui, Y Chen - Optimization Methods and Software, 2016 - Taylor & Francis
A sequential value correction heuristic is presented for the two-dimensional cutting stock
problem with three-staged homogenous patterns, considering both input-minimization and …
problem with three-staged homogenous patterns, considering both input-minimization and …
Towards bin packing (preliminary problem survey, models with multiset estimates)
MS Levin - arxiv preprint arxiv:1605.07574, 2016 - arxiv.org
The paper described a generalized integrated glance to bin packing problems including a
brief literature survey and some new problem formulations for the cases of multiset estimates …
brief literature survey and some new problem formulations for the cases of multiset estimates …
Heuristic for the cutting and purchasing decisions of multiple metal coils
Y Cui - Omega, 2014 - Elsevier
This paper presents a heuristic algorithm for the rectangular two-dimensional cutting stock
problem, where metal coils of multiple widths are divided into rectangular items with …
problem, where metal coils of multiple widths are divided into rectangular items with …