| 对“货郎担问题”的深入解析 |
| |
| 引用本文： | 汪林林,张林.对“货郎担问题”的深入解析[J].计算机科学,2002,29(1):103-104. |
| |
| 作者姓名： | 汪林林 张林 |
| |
| 作者单位： | 重庆邮电学院计算机系,重庆,400065 |
| |
| 摘 要： | 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.
|
| 关 键 词： | 图论 货郎担问题 最优货郎担回路 算法 |
A Study on Traveling Salesman Problem |
| |
| Abstract: | |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
