Mathematicians at Roskilde University and the University of Waterloo announced that, using the Open Source Routing Machine (OSRM), they have solved this staggering version of the traveling salesman ...

The goal of a combinatorial optimization problem is to find a set of distinct integer values that minimizes some cost function. The most famous example is the Traveling Salesman Problem (TSP). There ...