| 最小生成树算法在旅行商问题中的应用 |
| |
| 引用本文： | 李萍,王春红,王文霞,任姚鹏.最小生成树算法在旅行商问题中的应用[J].电脑开发与应用,2012,25(1):62-63. |
| |
| 作者姓名： | 李萍 王春红 王文霞 任姚鹏 |
| |
| 作者单位： | 运城学院计算机科学与技术系,山西运城,044000 |
| |
| 摘 要： | 如何在n个顶点之间的1/2(n-1)!巡回路径中选择距离最短的,这是一个典型的组合优化问题,也是解决旅行商问题的根本。在最小生成树的基本思想上进行了改进,成功地解决了旅行商问题。
|
| 关 键 词： | 最小生成树 旅行商问题 回路 连通图 |
Application of Minimum Cost Spanning Tree to Traveling Salesman Problem |
| |
| LI Ping
,
WANG Chun-hong
,
WANG Wen-xia
,
REN Yao-peng.Application of Minimum Cost Spanning Tree to Traveling Salesman Problem[J].Computer Development & Applications,2012,25(1):62-63. |
| |
| Authors: | LI Ping WANG Chun-hong WANG Wen-xia REN Yao-peng |
| |
| Affiliation: | (Yuncheng University Department of Computer Science and Technology,Yuncheng 044000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | minimum cost spanning tree traveling salesman problem loop connected graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
