[ki:]®Echo

You Are Viewing

A Blog Post

A simulation of the traveling salesman problem

Statistics In a nutshell, the traveling salesman problem is as follows: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” Todd Schneider made an interactive that lets you p

[Quelle/Source (Link): A simulation of the traveling salesman problem]