| Article ID: | iaor20101967 |
| Volume: | 22 |
| Issue: | 1 |
| Start Page Number: | 131 |
| End Page Number: | 143 |
| Publication Date: | Dec 2010 |
| Journal: | INFORMS Journal on Computing |
| Authors: | Kiwiel Krzysztof C |
| Keywords: | programming: linear |
We show that the linear programming relaxation of the cutting-stock problem can be solved efficiently by the recently proposed inexact bundle method. This method saves work by allowing inaccurate solutions to knapsack subproblems. With suitable rounding heuristics, our method solves almost all the cutting-stock instances from the literature.