| Article ID: | iaor19942171 |
| Country: | Germany |
| Volume: | 28 |
| Start Page Number: | 63 |
| End Page Number: | 84 |
| Publication Date: | Mar 1993 |
| Journal: | Optimization |
| Authors: | Scheithauer G., Terno J. |
| Keywords: | programming: integer |
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 also for three- and higher dimensional packing problems.