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 …
Sustainable and cost-effective optimal design of steel structures by minimizing cutting trim losses
Since the beginning of the structural optimization field, the optimal design was characterized
by the least-weight configuration. In this sense, all the researchers agreed on adopting the …
by the least-weight configuration. In this sense, all the researchers agreed on adopting the …
Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
D Pisinger, M Sigurd - INFORMS Journal on Computing, 2007 - pubsonline.informs.org
The two-dimensional bin-packing problem is the problem of orthogonally packing a given
set of rectangles into a minimum number of two-dimensional rectangular bins. The problem …
set of rectangles into a minimum number of two-dimensional rectangular bins. The problem …
[HTML][HTML] The two-dimensional bin packing problem with variable bin sizes and costs
D Pisinger, M Sigurd - Discrete Optimization, 2005 - Elsevier
The two-dimensional variable sized bin packing problem (2DVSBPP) is the problem of
packing a set of rectangular items into a set of rectangular bins. The bins have different sizes …
packing a set of rectangular items into a set of rectangular bins. The bins have different sizes …
A new heuristic recursive algorithm for the strip rectangular packing problem
D Zhang, Y Kang, A Deng - Computers & Operations Research, 2006 - Elsevier
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional
strip rectangular packing problem is presented. This algorithm is mainly based on heuristic …
strip rectangular packing problem is presented. This algorithm is mainly based on heuristic …
Solution approaches for the cutting stock problem with setup cost
A Mobasher, A Ekici - Computers & operations research, 2013 - Elsevier
In this paper, we study the Cutting Stock Problem with Setup Cost (CSP-S) which is a more
general case of the well-known Cutting Stock Problem (CSP). In the classical CSP, one …
general case of the well-known Cutting Stock Problem (CSP). In the classical CSP, one …
Cutting stock problems
H Ben Amor, J Valério de Carvalho - Column generation, 2005 - Springer
Column generation has been proposed by Gilmore and Gomory to solve cutting stock
problem, independently of Dantzig-Wolfe decomposition. We survey the basic models …
problem, independently of Dantzig-Wolfe decomposition. We survey the basic models …
A priority heuristic for the guillotine rectangular packing problem
A new priority heuristic is presented for the guillotine rectangular packing problem. This
heuristic first selects one available item for a given position by a priority strategy. Then it …
heuristic first selects one available item for a given position by a priority strategy. Then it …
Multi-dimensional bin packing problems with guillotine constraints
RR Amossen, D Pisinger - Computers & operations research, 2010 - Elsevier
The problem addressed in this paper is the decision problem of determining if a set of multi-
dimensional rectangular boxes can be orthogonally packed into a rectangular bin while …
dimensional rectangular boxes can be orthogonally packed into a rectangular bin while …
[HTML][HTML] A software for the one-dimensional cutting stock problem
In this paper, one-dimensional cutting stock problem is taken into consideration and a new
heuristic algorithm is proposed to solve the problem. In this proposed algorithm, a new …
heuristic algorithm is proposed to solve the problem. In this proposed algorithm, a new …