| Article ID: | iaor1994136 |
| Country: | Belgium |
| Volume: | 32 |
| Start Page Number: | 127 |
| End Page Number: | 137 |
| Publication Date: | May 1992 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Wilt A. van der |
| Keywords: | optimization, cutting stock |
An algorithm is given for a two-dimensional cutting problem. The cuts are supposed to be done in two stages in order to make a transformation into one-dimensional kanpsack problems possible. Each knapsack problem will be solved by an exact branch-and-bound algorithm for which reference will be made to the literature. An implementation was realized in TURBO PASCAL in order to make some computational tests. The results of these tests as well as some examples are given and discussed.