H. Dyckhoff, “A Typology of Cutting and Packing Problems,” European Journal of Operational Research, Vol. 44, No. 2, 1990, pp. 145-159. http://dx.doi.org/10.1016/0377-2217(90)90350-K
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: