The rectangular cutting problem is a branch of the two-dimensional cutting problems.
矩形件排样问题，是二维下料问题的一个分支。
In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.
本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。
Combing the theory of interval minimum load cutting problem, the improved greedy randomized adaptive search procedure (GRASP) is used to solve this model.
结合区间最小切负荷的相关理论，使用改进的贪婪随机自适应搜索算法可快速有效的求解该模型。
With the background of practical projects, aiming at cutting problem of space curve in shipbuilding industry, four axis robot system is designed. And it is used to cut the ends of the steel tubes.
本文以实际的工程项目为背景，针对船舶建造工业中常遇到的空间曲线切割问题，设计了此四自由度机器人，用于圆管端头切割。
As for the one-dimensional cutting problem, the paper comes up with a model of mutual deadline, in allusion to which, a new algorithm is put forward, that is, DP greedy algorithm.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
As for the one-dimensional cutting problem, the paper comes up with a model of mutual deadline, in allusion to which, a new algorithm is put forward, that is, DP greedy algorithm.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
应用推荐