On semidefinite programming relaxations of the traveling salesman problem

Etienne De Klerk (e.deklerkuvt.nl)
Dmitrii V. Pasechnik (dimantu.edu.sg)
Renata Sotirov (R.Sotirovuvt.nl)

Abstract: We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), 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-Vucic. 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 relaxation of Cvetkovic et al., the new SDP relaxation is not dominated by the linear programming relaxation with sub-tour elimination constraints.

Keywords: semidefinite programming, traveling salesman problem

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Category 2: Combinatorial Optimization

Citation: CentER Discussion Paper #2007-101 Tilburg University, The Netherlands, December 2007

Download: [PDF]

Entry Submitted: 12/17/2007
Entry Accepted: 12/17/2007
Entry Last Modified: 01/31/2008

Modify/Update this entry