比方说旅行推销员问题。
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.
采用随机三角点阵上城市间的最近邻关系，构造路径子空间来求解旅行推销员问题。
The nearest neighbour relation between cities on random triangle lattice has been used to construct a tour subspace and to solve the traveling salesman problem.
应用推荐