| Article ID: | iaor19982262 |
| Country: | Belgium |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 57 |
| End Page Number: | 71 |
| Publication Date: | Jan 1996 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Wilt A. Van der |
| Keywords: | heuristics, programming: branch and bound |
In the literature there exist only a few solution techniques for bounded two-dimensional cutting problems. Therefore, we propose three heuristics which are user friendly on a PC and can solve the bounded case of the cutting problem in a minimum of computing time. By a number of numerical tests, the algorithms are comapred with each other and with the exact solution of Christofides and Whitlock. Finally, we discuss the advantages and disadvantages of the proposed heuristics.