Samuel Gheverghese
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.
この記事をシェアする
English 
Spanish 
Chinese 
Russian 
German 
French 
Portuguese 
Hindi 