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 ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

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 ...

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 ...

Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial ...