An Algorithm on Traveling Salesman Problem
Duan Chan · Acta Scientiarum Naturalium Universitatis Neimongol · 2001
We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in 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.