| Article ID: | iaor20083127 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 5 |
| Start Page Number: | 636 |
| End Page Number: | 644 |
| Publication Date: | Sep 2007 |
| Journal: | Operations Research Letters |
| Authors: | Arslanov M.Z. |
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.