1) China traveling salesman problem
中国货郎担问题
1.
To present a new polynomial time algorithm for China traveling salesman problem, first, point set was partitioned into a number of subpoint sets by using convex hull and medial axis.
研究求解中国货郎担问题最短回路的多项式时间算法。
2) Traveling Salesman Problem
货郎担问题
1.
Solutions to Traveling Salesman Problem (TSP) Based on Self-Organizing Maps (SOM);
基于自组织网络的货郎担问题解决方案
2.
The linkage s effects on genetic algorithms are demonstrated by an example of Traveling Salesman Problem.
作为一种启发式应用于遗传算法 ,然后以货郎担问题为例将连锁应用于遗传算法的具体过程 ,最后通过测试实验 ,对带连锁的遗传算法与不带连锁的遗传算法的实验结果进行比较。
3.
In the traveling salesman problem("TSP" for short),given n nodes and for each pair {i,j} of distinct nodes,a distance di,j,it desires a closed path that visits each node exactly once and incurs the least cost,which is the sum of the distances along the path.
货郎担问题的实例是给定n个结点和任意一对结点{i,j}之间的距离di,j,要求找出一条封闭的回路,该回路经过每个结点一次且仅一次,并且费用最小,这里的费用是指回路上相邻结点间的距离和。
3) Travel Salesman Problem
货郎担问题
1.
Practice of Searching for a Solution to the Travel Salesman Problem;
求解货郎担问题的认识和实践
4) TSP
货郎担问题
1.
Comparison and Analyse between Genetic Algorithm and Hopfield Network to Resolve TSP;
遗传算法和Hopfield模型求解货郎担问题的比较和分析
2.
A new method is given to resolve TSP by using the features of quantum waves.
利用波的特性在量子环境下对货郎担问题(TSP)进行了求解,介绍了这种量子算法的基本思想及相关 概念,然后分析并给出了求解货郎担问题的量子算法,最后对量子算法的发展进行了展望。
5) Traveling salesman problem
货郎担问题(TSP)
6) Time Limited Traveling Salesman Problem
有时限的货郎担问题
补充资料：货郎担
1.货郎挑的杂货担。亦指货郎。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条