Modeling of packing problems

Abstract

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

Keywords:

• Cutting and Packing Problems
• Packing of Polygons
• Modeling
• Linear Mixed-integer Modeling
• Hodograph