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

This paper presents the development of new elimination tests which greatly enhance the performance of a relatively well established dynamic programming approach and its application to the minimization ...

The task is the long-standing challenge known as the traveling salesman problem, or TSP for short. Finding a method that can quickly solve every example of the TSP would be a stunning breakthrough ...