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 present a polynomial-time approximation algorithm with worst-case ratio 7/6 for the special case of the traveling salesman problem in which all distances are either one or two. We also show that ...

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