Mathematical puzzles don't often get to star in feature films, but P vs NP is the subject of an upcoming thriller from Timothy Lanzone called "Travelling Salesman". The titles refers to the ...

A classic mathematical problem that finds the shortest distance of round trip travel between multiple locations. The traveling salesman problem (TSP) generates directions from city 1 to city 2 and so ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a team has shown that a certain class of such problems can actually be solved better and much ...

A traveling salesman stands at a train station in St. Louis, carefully considering his path. He must make stops in Chicago, New Orleans and Mason City, Iowa, among others, before returning home. And ...