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

83 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

@article{9367c814ed104d31a9fc3a216f5cc731,
title = "A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths",
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.",
keywords = "Branch-and-bound, Column generation, Cutting, Cutting planes, Heuristics",
author = "G. Belov and G. Scheithauer",
year = "2002",
month = "9",
day = "1",
doi = "10.1016/S0377-2217(02)00125-X",
language = "English",
volume = "141",
pages = "274--294",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. / Belov, G.; Scheithauer, G.

In: European Journal of Operational Research, Vol. 141, No. 2, 01.09.2002, p. 274-294.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

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

AU - Belov, G.

AU - Scheithauer, G.

PY - 2002/9/1

Y1 - 2002/9/1

N2 - 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.

AB - 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.

KW - Branch-and-bound

KW - Column generation

KW - Cutting

KW - Cutting planes

KW - Heuristics

UR - http://www.scopus.com/inward/record.url?scp=0036722342&partnerID=8YFLogxK

U2 - 10.1016/S0377-2217(02)00125-X

DO - 10.1016/S0377-2217(02)00125-X

M3 - Article

VL - 141

SP - 274

EP - 294

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -