%0 Journal Article
%T GEOMETRIC METHOD FOR SOLVING TS PROBLEM<br>货郎担问题的几何解法
%A Zhou Peide
%A <br>周培德
%J 软件学报
%D 1995
%I 
%X 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().
%K Geometric algorithm
%K algorithmic complexity
%K travel salesman problem<br>几何算法
%K 算法复杂性
%K 货郎担问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=FECB12B3BE5A15C82D00CDE75399DFBA&yid=BBCD5003575B2B5F&vid=B31275AF3241DB2D&iid=DF92D298D3FF1E6E&sid=5335AD3CFE6E14EA&eid=D1D63D047E37A053&journal_id=1000-9825&journal_name=软件学报&referenced_num=8&reference_num=3