Is it hopeless to try to compute the shortest route to visit a large number of cities? Not just a good route but the guaranteed shortest. The task is the long-standing challenge known as the traveling ...

We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software, and a short (60 line long) ...

We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that seeks the shortest route between many locations while visiting each only ...