| Article ID: | iaor20031907 |
| Country: | Netherlands |
| Volume: | 141 |
| Issue: | 2 |
| Start Page Number: | 274 |
| End Page Number: | 294 |
| Publication Date: | Sep 2002 |
| Journal: | European Journal of Operational Research |
| Authors: | Scheithauer G., Belov G. |
| Keywords: | programming: integer, programming: branch and bound |
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.