On Semidefinite Programming Relaxations of the Traveling Salesman Problem

Abstract

We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: D. Cvetkovic, M. Cangalovic and V. Kovacevic-Vujcic. Semidefinite Programming Methods for the Symmetric traveling Salesman Problem. In Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization, 1999, 126-136, Springer-Verlag, London, UK. Unlike the bound of Cvetkovic et al., the new SDP bound is not dominated by the Held-Karp linear programming bound, or vice versa.

Keywords: traveling salesman problem, semidefinite programming, quadratic assignment problem, association schemes

JEL Classification: C61