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 Nathan Yau See All →
Best Burger Ranks
Survey participants were asked to grade fast food burger restaurants on eight criteria. This is how each restaurant ranked.
Divorce Rates for Different Groups
We know when people usually get married. We know who never marries. Finally, it’s time to look at the other side: divorce and remarriage.