H. W. Lenstra Jr., “Integer Programming with a Fixed Number of Variables,” Mathematics of Operations Research, Vol. 8, No. 4, 1983, pp. 538-548.
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.