Application of Minimum Cost Spanning Tree to Traveling Salesman Problem
Ren Yao-peng · Computer Development & Applications · 2012
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.