Polygon plate-cutting with a given order

被引：4

作者：

Dror, M ^{[1
]}

机构：

[1] Univ Arizona, MIS Dept, Tucson, AZ 85721 USA

来源：

IIE TRANSACTIONS | 1999年 / 31卷 / 03期

关键词：

D O I：

10.1023/A:1007606007369

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This note is a complement to the paper by Hoeft and Palekar [1] which describes the problem of cutting polygonal shapes from large plates of metal or glass. More specifically, we focus on polynomial time solvability for a number of subproblems of the more general plate-cutting problem. A primary result of this note is the polynomial time solvability for the plate-cutting problem with a given order and convex polygons.

引用

页码：271 / 274

页数：4

共 5 条

[1] POSTMAN TOUR ON A GRAPH WITH PRECEDENCE RELATION ON ARCS [J].