%0 Journal Article
%T A Quick Algorithm for Calculating the Lower Bound of Symmetric Traveling Salesman Problem<br>对称型TSP下界的快速估算法
%A NING Ai-bing
%A MA Liang
%A <br>宁爱兵
%A 马良
%J 系统工程理论与实践
%D 2004
%I 
%X Based on mathematical inference and proof, we propose a quick algorithm for calculating the lower bound of symmetric Travelling Salesman Problem. By using the algorithm, series of numerical examples of TSP(traveling salesman problem) from TSBLIB are solved and the computational results are compared with the best-known solutions published, which give promising results.
%K TSP(traveling salesman problem)
%K lower bound
%K algorithm
%K approximation ratio<br>旅行商问题
%K 下界
%K 算法
%K 逼近程度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=9D428400F3EFE68A&yid=D0E58B75BFD8E51C&vid=B91E8C6D6FE990DB&iid=59906B3B2830C2C5&sid=656F8C8401D91023&eid=7E8E8B150580E4AB&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=4&reference_num=6