摘要
如何在n个顶点之间的1/2(n-1)!巡回路径中选择距离最短的,这是一个典型的组合优化问题,也是解决旅行商问题的根本。在最小生成树的基本思想上进行了改进,成功地解决了旅行商问题。
It is a typical combinatorial optimization problem and the fundament of solving traveling salesman problem that how to find the shortest loop from half of factorial of n-1 between n vertex.In the text through importing the basic idea of minimum cost spanning tree,the traveling salesman problem is solved successfully.
出处
《电脑开发与应用》
2012年第1期62-63,共2页
Computer Development & Applications
关键词
最小生成树
旅行商问题
回路
连通图
minimum cost spanning tree
traveling salesman problem
loop
connected graph
