The traveling salesman problem asks: Given a collection of cities connected by highways, what is the shortest route that visits every city and returns to the starting place? The answer has ...

A map illustrating the shortest possible walking (and public ferry) route to nearly 50,000 sites on the National Register of Historic Places, a total length of 217,605 miles.

You might say that these hard problems are all the same computational gremlin wearing different hats. The best route is hard to find The problem is usually stated as “find the shortest route.” ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network ...

The Travelling Salesperson Problem a combinatorial optimization problem and one of the most intensively studied puzzles in mathematics. The challenge is to find the shortest route that visits every ...

The most efficient path that visits each of 2 million stars just once We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that ...

Houston’s construction works by translating the superpermutation problem into the famous traveling salesman problem, which looks for the shortest route through a collection of cities.

When Big Data Maps Your Safest, Shortest Walk Home A new paper uses open data to find trade-offs between the safest and shortest paths between two points.