中英互译

traveling salesman problem

基本释义

The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
The problem in Chow expect travel around, every city is accessed once and only once, we take into account the solution to the traveling salesman problem.
本题中周先生想到各地旅游，每个城市都被访问一次且仅一次，我们考虑到了旅行商问题的解决方法。