Article ID: | iaor1997880 |
Country: | France |
Volume: | 30 |
Issue: | 2 |
Start Page Number: | 111 |
End Page Number: | 125 |
Publication Date: | Apr 1996 |
Journal: | RAIRO Operations Research |
Authors: | Zissimopoulos Vassilis, Hiffi Mhand |
Keywords: | programming: dynamic |
The recursive algorithm of Herz is the better actually known algorithm for solving two-dimensional cutting stock problems. The authors propose some modifications relied on one-dimensional knapsack and dynamic programming principles which improve significantly the computational power of the algorithm.