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

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

下载PDF

导出

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

作者 M. Z. Arslanov

机构地区 Institute of Problems of Informatics and Control

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

关键词 CUTTING CONVEX HULL Polynomial Algorithms Cutting Convex Hull Polynomial Algorithms

分类号 O1 [理学—基础数学]

引文网络
相关文献

1Fang YU,Jin-chuan CUI.The Efficient Computation of Aircraft Range Problem[J].Acta Mathematicae Applicatae Sinica,2019,35(4):862-872.
2Jihui Wang,Qiaoling Ma.Some Results on Edge Cover Coloring of Double Graphs[J].Applied Mathematics,2012,3(3):264-266.
3Fethi Jarray.Complexity Results for Wireless Sensor Network Scheduling[J].Wireless Sensor Network,2010,2(5):343-346.

American Journal of Operations Research

2014年第1期

浏览历史

内容加载中请稍等...

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

相关作者

相关机构

相关主题

浏览历史