In this paper, a new dynamic programming algorithm for unconstrained 2D stock cutting problem is presented.

摘要本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。