Optimization problems in a semi-automatic device for cutting leather

MaRDI QIDQ4450517zbMATH OpenFDO

Authors Alexander Pott, Holger Glaab

Publication date 15 February 2004

zbMATH Keywords

cutting leatherheuristics approachinteger linear programmingoptimization problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Automated systems (robots, etc.) in control theory (93C85) Application models in control theory (93C95)

Review text

For a machine designed to cut large leather skins, two problems are very important: to find paths which are minimal with respect to scanner movements, and to find a good path for the cutting knife. In this paper the authors propose two mathematical models (two integer linear programming models) for solving these problems (with heuristic approaches). For the entire collection see [Zbl 1016.00014].

Recommendations

• scientific article; zbMATH DE number 1225325
• The algorithms for constructing of cutter optimal path
• scientific article; zbMATH DE number 3934748
• Exact approaches for the cutting path determination problem
• scientific article; zbMATH DE number 3996512

Cited in

(2)

• Exact approaches for the cutting path determination problem
• scientific article; zbMATH DE number 3996512 (Why is no real title available?)

This page was built for publication: Optimization problems in a semi-automatic device for cutting leather

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450517)