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

G. Belov, G. Scheithauer

Research output: Contribution to journalArticleResearchpeer-review

87 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)274-294
Number of pages21
JournalEuropean Journal of Operational Research
Volume141
Issue number2
DOIs
Publication statusPublished - 1 Sep 2002

Keywords

  • Branch-and-bound
  • Column generation
  • Cutting
  • Cutting planes
  • Heuristics

Cite this