one-dimensional cutting stock 一维下料
one-dimensional cutting-stock 一维下料
one-dimensional cutting problem 一维下料问题
one-dimensional cutting stock problem 一维排样问题
one dimensional cutting stock problem 一维下料
one-dimensional cutting-stock problem 一维下料问题
one-dimensional cutting stock problems 一维下料问题
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
One-dimensional cutting stock optimization and two-dimensional data sets optimal matching problem are mainly researched in this thesis.
本文主要研究了一维下料优化及二维数据集最佳匹配两大问题。
With the rapid development of national economy in recent years, the one-dimensional cutting stock problem occurs in many industry areas.
近年来，随着国民经济的飞速发展，一维下料问题在建筑、电力、水利等领域获得了越来越广泛的应用。
应用推荐