通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
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.
变序集上周期最小的最优控制可以转化为一个求解旅行推销员问题，而最优调度恰好是一类特殊的最优控制。
The optimal control of minimal period on the changing order set can be transferred into the calculation for problem of trip salesman, and the optimal arrangement is a special optimal control.
这样，它们有效地解决了“旅行推销员问题”，即如果一个旅行推销员需访问多个地点，如何找到访问这些地点的最短路线。
In this way, they effectively solved the "traveling salesman problem," which involves finding the shortest route that allows a traveling salesman to call at all the locations he has to visit.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
应用推荐