M. Z. Arslanov, “A Polynomial Algorithm for One Problem of Guillotine Cutting,” Operations Research Letters, Vol. 35, No. 5, 2007, pp. 636-644. http://dx.doi.org/10.1016/j.orl.2006.12.003
has been cited by the following article:
TITLE: A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights
AUTHORS: M. Z. Arslanov
KEYWORDS: Cutting; Convex Hull; Polynomial Algorithms
JOURNAL NAME: American Journal of Operations Research, Vol.4 No.1, January 23, 2014
ABSTRACT: We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.
Related Articles: