Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
Abstract
The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, e.g., algebraic connectivity, permutation matrices, and association schemes. The main results of this paper are twofold. First, de Klerk and Sotirov [9] present an SDP based on permutation matrices and symmetry reduction; they show that it is incomparable to the subtour elimination linear program, but generally dominates it on small instances. We provide a family of \emph{simplicial TSP instances} that shows that the integrality gap of this SDP is unbounded. Second, we show that these simplicial TSP instances imply the unbounded integrality gap of every SDP relaxation of the TSP mentioned in the survey on SDP relaxations of the TSP in Section 2 of Sotirov [24]. In contrast, the subtour LP performs perfectly on simplicial instances. The simplicial instances thus form a natural litmus test for future SDP relaxations of the TSP.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2019
- DOI:
- 10.48550/arXiv.1907.09054
- arXiv:
- arXiv:1907.09054
- Bibcode:
- 2019arXiv190709054G
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- Computer Science - Discrete Mathematics;
- Mathematics - Optimization and Control