The TSP (Travelling Salesman Problem)

Question

Do you know any good coded algorythm (any language, C++ preferred) to cope with the Travelling Salesman Problem?

Answer 1

https://youtu.be/BAejnwN4Ccw

https://youtu.be/JE0JE8ce1V0

Answer 2

Paolo De Nictolis you can read about minimum spanning tree and Prima's algorithm for example

Answer 3

There are many ways to solve it:
exhaustive search
random brute force
the cheapest method of inclusion
minimum spanning tree method
And so on.
Algorithm which you should choose depends mostly on your problem

Answer 4

There are many solutions. Y ou need to choose the one that corresponds to the task.
There are different asymptotics and occupied memory, and the task itself can be also different

Answer 5

Any example?