A branch-and-price algorithm for solving the cutting strips problem

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
275 Downloads (Pure)

Abstract

After giving a suitable model for the cutting strips problem, we present a branch-and-price algorithm for it by combining the column generation technique and the branch-and-bound method with LP relaxations. Some theoretical issues and implementation details about the algorithm are discussed, including the solution of the pricing subproblem, the quality of LP relaxations, the branching scheme as well as the column management. Finally, preliminary computational experience is reported.
Original languageEnglish
Pages (from-to)215-224
JournalApplied Mathematics, Series B (English Edition)
Volume12
Issue number2
DOIs
Publication statusPublished - 1997

Fingerprint

Dive into the research topics of 'A branch-and-price algorithm for solving the cutting strips problem'. Together they form a unique fingerprint.

Cite this