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贪婪算法。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
With the rapid development of national economy in recent years, the one-dimensional cutting stock problem occurs in many industry areas.
近年来，随着国民经济的飞速发展，一维下料问题在建筑、电力、水利等领域获得了越来越广泛的应用。
应用推荐