Showing 1 - 3 of 3
In this paper, a dynamic programming-based recursive method is proposed for solving an unconstrained 2D rectangular cutting problem. The algorithm is an incomplete method, in which some intricate cutting patterns may not be obtained. The worst case performance of the algorithm is evaluated and...
Persistent link: https://www.econbiz.de/10008483198
Persistent link: https://www.econbiz.de/10005152122
Persistent link: https://www.econbiz.de/10008349156