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

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