On semidefinite programming relaxations of the traveling salesman problem

• Main Authors: De Klerk, Etienne., Pasechnik, Dmitrii V., Sotirov, Renata.
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2009
• Subjects: DRNTU::Science::Mathematics::Applied mathematics::Operational research
• Online Access: https://hdl.handle.net/10356/91852; http://hdl.handle.net/10220/4600; http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?url_ctx_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Actx&url_ver=Z39.88-2004&url_tim=2009-05-07T03%3A41%3A58-0400&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rft.spage=1559&rft.volume=19&rft.aulast=de+Klerk&rft.issn=10957189&rft_id=info%3Adoi%2F10.1137%2F070711141&rft.jtitle=SIAM+Journal+on+Optimization&rft.genre=article&rft.auinit1=E&rft.date=2008&rft.issue=4&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rfr_id=info%3Asid%2Faip.org%3Ascitation
• Institution: Nanyang Technological University

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 [D. Cvetković, M. Cangalović, and V. Kovačević-Vujčić, Semidefinite programming methods for the symmetric traveling salesman problem, in Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization, Springer-Verlag, London, UK, 1999, pp. 126–136]. Unlike the bound of Cvetković et al., the new SDP bound is not dominated by the Held–Karp linear programming bound, or vice versa.