A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
Volume 23 / 1995
Applicationes Mathematicae 23 (1995), 151-167
DOI: 10.4064/am-23-2-151-167
Abstract
Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.
