摘要
本文综述了旅行推销员问题 (TSP)近几十年来的算法研究进展 。
This paper surveys the algorithmic research development of the travelling salesman problem. Main ideas of these algorithms are presented together with their time complexities.
出处
《数学的实践与认识》
CSCD
2000年第2期156-165,共10页
Mathematics in Practice and Theory
