An improved spanning tree algorithm for solving the Traveling Salesman Problem
Zhao Qing Yuan · Journal of Lanzhou University · 2008
An algorithm based on spanning tree is given in this paper for solving the TSP,the algorithm combine the greedy and matching methods,so the local solution in traditional approximate algorithm is changed into the optimal solution,and avoid the larger error produced in the nearest-neighbor algorithm.At last we anylicized the algorithm's complexity.Experiment results show that the algorithm is more practical.