Article ID: | iaor1992111 |
Country: | Germany |
Volume: | 22 |
Start Page Number: | 461 |
End Page Number: | 466 |
Publication Date: | Oct 1991 |
Journal: | Optimization |
Authors: | Scheithauer G. |
Keywords: | programming: dynamic |
In this note the handling of utilizable residual lengths is investigated for the one-dimensional cutting stock problem. The corresponding continuous relaxation problem is solved using the column generation technique. Finally, extensions to the two-dimensional cutting stock problem are discussed.