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 …

The one-dimensional cutting stock problem (1D-CSP) and the two-dimensional two-stage
guillotine constrained cutting problem (2D-2CP) are considered in this paper. The Gilmore …

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 …

A cutting plane approach combining Chvatal–Gomory cutting planes with column generation
is generalized for the case of multiple stock lengths in the one-dimensional cutting stock …

Rebar is one of the most important construction materials in engineering projects. For
reinforced concrete structures, rebar consumption accounts for about 16% of the total project …

This study introduces an arc-flow formulation and the first branch-and-price-and-cut (BPC)
algorithm designed to solve the bin-packing problem with fragile objects (BPPFO). This …

Within such disciplines as Management Science, Information and Computer Science,
Engineering, Mathematics and Operations Research, problems of cutting and packing (C&P) …

The cutting stock problem (CSP) is one of the most fascinating problems in operations
research. The problem aims at determining the optimal plan to cut a number of parts of …

This paper considers the integer one-dimensional cutting stock problem with different types
of standard lengths and the objective of cost minimization. Decomposition approaches …

One-dimensional stock cutting problems can be encountered at the production stage of
many areas of engineering as well as in shipbuilding and coastal structures. In this paper, a …