Equivalence of an Approximate Linear Programming Bound with the Held-Karp Bound for the Traveling Salesman Problem

We consider two linear relaxations of the asymmetric traveling salesman problem (TSP), the Held-Karp relaxation of the TSP’s arc-based formulation, and a particular approximate linear programming (ALP) relaxation obtained by restricting the dual of the TSP’s shortest path formulation. We show that the two formulations produce equal lower bounds for the TSP’s optimal cost regardless of cost structure; i.e. costs need not be non-negative, symmetric or metric. We then show how the ALP formulation can be modied to yield a relaxation for several TSP variants, and discuss how the formulations dier from arc-based relaxations.