Abstract
We consider a cutting problem, which have a practical application. In this problem, items are being cut from larger items, for example textile patterns from a panel of cloth. We deal steel tubes of given length, which have to be sawed from longer steel tubes. These longer steel tubes come with given costs and the sawing has to be planned such that the total costs are minimized. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Deppe, C., & Wischmann, C. (2013). A heuristic solution of a cutting problem using hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 658–676). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
