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 →
Redefining Old Age
What is old? When it comes to subjects like health care and retirement, we often think of old in fixed terms. But as people live longer, it’s worth changing the definition.
Who Earns More Income in American Households?
Compared to 1970, a shift towards women making the higher income.
Toilet Paper Calculator
Maybe you’re starting to run low. Here’s how much you’ll need when you go to restock.