Polygon plate-cutting with a given order

Moshe Dror

doi:10.1080/07408179908969826

Polygon plate-cutting with a given order

Moshe Dror

Management Information Systems

Research output: Contribution to journal › Article › peer-review

Abstract

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 plalecutting problem with a given order and convex polygons.

Original language	English (US)
Pages (from-to)	271-274
Number of pages	4
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	31
Issue number	3
DOIs	https://doi.org/10.1080/07408179908969826
State	Published - Mar 1999

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

Access to Document

10.1080/07408179908969826

Cite this

@article{4f74d0c1fd2445c3ac1f4f1729d51038,

title = "Polygon plate-cutting with a given order",

abstract = "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 plalecutting problem with a given order and convex polygons.",

author = "Moshe Dror",

year = "1999",

month = mar,

doi = "10.1080/07408179908969826",

language = "English (US)",

volume = "31",

pages = "271--274",

journal = "IIE Transactions (Institute of Industrial Engineers)",

issn = "0740-817X",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - Polygon plate-cutting with a given order

AU - Dror, Moshe

PY - 1999/3

Y1 - 1999/3

N2 - 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 plalecutting problem with a given order and convex polygons.

AB - 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 plalecutting problem with a given order and convex polygons.

UR - http://www.scopus.com/inward/record.url?scp=85023789263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023789263&partnerID=8YFLogxK

U2 - 10.1080/07408179908969826

DO - 10.1080/07408179908969826

M3 - Article

AN - SCOPUS:85023789263

SN - 0740-817X

VL - 31

SP - 271

EP - 274

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 3

ER -

Polygon plate-cutting with a given order

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this