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 punch in the cities yourself and then watch the process look for an optimum route. Fun to play with even if you’re not into processes. [Thanks, Todd]
A simulation of the traveling salesman problem
Projects by FlowingData See All →
Data Underload #6 – Bed Head
Your hair distribution in the morning, based on how you slept the previous night.
Who spends the most years in retirement?
Early retirement. That’s what most people want, unless you’re lucky …