A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights  

作　　者：M. Z. Arslanov 

机构地区：[1]Institute of Problems of Informatics and Control, Almaty, Kazakhstan

出　　处：《American Journal of Operations Research》2014年第1期22-29,共8页美国运筹学期刊（英文）

摘　　要：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.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.

关 键 词：CUTTING CONVEX HULL Polynomial Algorithms 

分 类 号：O1[理学—数学]