GEOMETRIC METHOD FOR SOLVING TS PROBLEM
货郎担问题的几何解法

In this paper, a new geometric method for solving TS problem is presented.Let n be the number of points in the point set, and m be the number of vertexes in convex hulls of the point set. The time complexity of the algorithm is: the number of computation distance is O(nm), the number of comparisons is O(max(nm, nlogn) ) and the number of computation included angle is O().