| Article ID: | iaor20031634 |
| Country: | China |
| Volume: | 32 |
| Issue: | 6 |
| Start Page Number: | 695 |
| End Page Number: | 696 |
| Publication Date: | Nov 2001 |
| Journal: | Acta Scientiarum Naturalium Universitatis NeiMongol |
| Authors: | Duan Chanlun, Si Qinfu |
| Keywords: | graphs |
We present an algorithm for the travelling salesman problem using the method of self-saturated subscript in a cycle. Even if we cannot improve the time complexity of this problem in essence, in which the time complexity is a NP-hard, however, this algorithm is faster than the method of Branch-Delimitation and other approximation algorithms in speed.