摘要： 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 th

关键词: 图论 货郎担问题 最优货郎担回路 算法