Polynomial Time Solution of Travelling Salesman Problem

Journal of Applied & Computational Mathematics

article

Samuel Gheverghese¹ 

[1] Computer Science and Engineering, TKM College of Engineering

关键词: Travelling;    Salesman;    Problem;    Solution;    Algorithm;   

DOI  :  10.4172/2168-9679.1000219

来源: Hilaris Publisher

【 摘 要 】

This note is for finding a polynomial time solution for the "Travelling Salesman Problem" for a "Complete" graph for any number of vertices. The solutions that I am getting for the examples given in the textbooks are giving the correct answers. If new examples are tried to further test the algorithm and the answers are approximately very near to the correct answer, then this algorithm can be considered as a new type of heuristic algorithm.

【 授权许可】

Unknown