A comparison of lower bounds for the symmetric circulant traveling salesman problem

Research output: Contribution to journalArticleScientificpeer-review

24 Citations (Scopus)


When the matrix of distances between cities is symmetric and circulant, the traveling salesman problem (TSP) reduces to the so-called symmetric circulant traveling salesman problem (SCTSP), that has applications in the design of reconfigurable networks, and in minimizing wallpaper waste. The complexity of the SCTSP is open, but conjectured to be NP-hard, and we compare different lower bounds on the optimal value that may be computed in polynomial time. We derive a new linear programming (LP) relaxation of the SCTSP from the semidefinite programming (SDP) relaxation in [E. de Klerk, D.V. Pasechnik, R. Sotirov, On semidefinite programming relaxation of the traveling salesman problem, SIAM Journal of Optimization 19 (4) (2008) 1559–1573]. Further, we discuss theoretical and empirical comparisons between this new bound and three well-known bounds from the literature, namely the Held-Karp bound [M. Held, R.M. Karp, The traveling salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138–1162], the 1-tree bound, and the closed-form bound for SCTSP proposed in [J.A.A. van der Veen, Solvable cases of TSP with various objective functions, Ph.D. Thesis, Groningen University, The Netherlands, 1992].
Original languageEnglish
Pages (from-to)1815-1826
JournalDiscrete Applied Mathematics
Issue number16
Publication statusPublished - 2011


  • semidefinite programming
  • traveling salesman problem
  • circulant matrices


Dive into the research topics of 'A comparison of lower bounds for the symmetric circulant traveling salesman problem'. Together they form a unique fingerprint.

Cite this