期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Study of Travelling Salesman Problem 被引量:1
1
作者 wanglin-lin WANGJin 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2001年第1期15-19,共5页
The Travelling 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... The Travelling 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 to 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. 展开更多
关键词 TSP ALGORITHM complexity of algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部