DMCA
A Branch-and-Cut-and-Price Algorithm for One- and Two-Dimensional Two-Staged Cutting (Stock) Problems (2003)
Cached
Download Links
by
G. Belov
,
G. Scheithauer
| Citations: | 17 - 2 self |
BibTeX
@MISC{Belov03abranch-and-cut-and-price,
author = {G. Belov and G. Scheithauer},
title = {A Branch-and-Cut-and-Price Algorithm for One- and Two-Dimensional Two-Staged Cutting (Stock) Problems},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The one-dimensional cutting stock problem and the two-dimensional two-staged constrained guillotine cutting (knapsack) problem are considered. They can be formulated by column generation. This model has a very tight continuous relaxation which provides a good bound in an LP-based solution approach. We combine a branching scheme and a cutting plane algorithm using Gomory mixed-integer and strengthened Chvatal-Gomory cuts.
