Article ID Journal Published Year Pages File Type
1142999 Operations Research Letters 2007 9 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A polynomial algorithm for one problem of guillotine cutting
Authors
,