Modeling of packing problems
暂无分享,去创建一个
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
[1] John E. Beasley,et al. An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..
[2] Brenda S. Baker,et al. Polygon Containment under Translation , 1986, J. Algorithms.
[3] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .