A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

Gleb Belov, Guntram Scheithauer

Abstract: 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 problem. Appropriate modifications of the column generation procedure and the rounding heuristic are proposed. A comparison with the branch-and-price method for the problem with one stock type and representative test results are reported.