| Article ID: | iaor20014204 |
| Country: | China |
| Volume: | 30 |
| Issue: | 2 |
| Start Page Number: | 156 |
| End Page Number: | 165 |
| Publication Date: | Apr 2000 |
| Journal: | Mathematics in Practice and Theory |
| Authors: | Ma Liang |
This paper surveys the algorithmic research development of the travelling salesman problem. Main ideas of these algorithms are presented together with their time complexities.