| Article ID: | iaor20072940 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 6 |
| Start Page Number: | 630 |
| End Page Number: | 638 |
| Publication Date: | Nov 2006 |
| Journal: | Operations Research Letters |
| Authors: | Cui Yaodong |
| Keywords: | programming: integer, programming: branch and bound |
This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.