%0 Journal Article
%T A Study on Traveling Salesman Problem<br>对“货郎担问题”的深入解析
%A 汪林林
%A 张林
%J 计算机科学
%D 2002
%I 
%X The Traveling Salesman Problem(TSP) is one of the most difficult problems that many scholars all over the world are studying.This paper points out the disparity between the definition and the classical solution of TSP and its practical applications,and the presents a new definition of TSP and its effective algorithm conforming to practical applications,thus making TSP practically more valuable.
%K 图论
%K 货郎担问题
%K 最优货郎担回路
%K 算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=FD55CEB276F7ACD0&yid=C3ACC247184A22C1&vid=771469D9D58C34FF&iid=CA4FD0336C81A37A&sid=89F76E117E9BDB76&eid=DBF54A8E2A721A6D&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=7