N.Christofides and C.Whitlock. An algorithm for two-dimensional cutting problems. Operations Research, 25:30-44, 1977
-
In this paper Christofides and Whitlock introduce 7 instances of the two-dimensional guillotine cutting problem. Sadly only three of these problems have been published.
These instances were solved to optimality by a tree-search algorithm that has been implemented in FORTRAN IV and run on a CDC 7600 using the FTN compiler.
| Problem | Container Size | Box Types | # Boxes | Value | Time |
| CGCUT1 | ( 15, 10) |
7 |
16 |
244 |
2.47 s |
| CGCUT2 | ( 40, 70) |
10 |
23 |
2892 |
24.07 s |
| CGCUT3 | ( 40, 70) |
20 |
62 |
1860 |
1.61 s |