| 对“货郎担问题”的研究 |
| |
| 引用本文： | 汪林林.对“货郎担问题”的研究[J].重庆邮电学院学报(自然科学版),1999,11(2):5-8. |
| |
| 作者姓名： | 汪林林 |
| |
| 作者单位： | 重庆邮电学院计算机系 |
| |
| 摘 要： | “货郎担问题”是不少学者研究的世界难题之一。本文指出“货郎担问题”的描述及经典解法与实际应用上的差距，从而给出与实际应用相符合的“货郎担问题”：的研究义及其有效的算法，从而使该问题更具有重要的实用价值。
|
| 关 键 词： | 货郎担问题 算法 算法时间复杂度 图论 |
A Study on Traveling Salesman Problem |
| |
| Wang Linlin.A Study on Traveling Salesman Problem[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),1999,11(2):5-8. |
| |
| Authors: | Wang Linlin |
| |
| Abstract: | 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 then presents a new definition of TSP and its effective algorithm conforming to practical applications,thus making TSP practically more valuable. |
| |
| Keywords: | TSP algorithm time complexity of algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
