Modeling of packing problems

Autor:	J. Terno, Guntram Scheithauer
Rok vydání:	1993
Předmět:	Combinatorics Packing problems Control and Optimization Set packing Hodograph Applied Mathematics Regular polygon Applied mathematics Management Science and Operations Research Mathematics
Zdroj:	Optimization. 28:63-84
ISSN:	1029-4945 0233-1934
DOI:	10.1080/02331939308843904
Popis:	In this paper the modeling of packing problems (cutting and allocation problems) is investigated. Especially, linear mixed-integer models are proposed for two-dimensional packing problems of convex and non-convex polygons. The models are based on the so-called (outer) hodograph and the inner hodograph. Rotations of the polygons are not allowed. The principles of modeling in the two-dimensional case can be applied alsofor three- and higher dimensional packing problems
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cf9358c4e1863262ca862ea97dfb43b4 https://doi.org/10.1080/02331939308843904 Zobrazit plný text záznamu