Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps

07/21/2019
by   Samuel C. Gutekunst, et al.
0

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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2017

The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem

We study a semidefinite programming relaxation of the traveling salesman...
research
06/06/2022

New lower bounds on crossing numbers of K_m,n from permutation modules and semidefinite programming

In this paper, we use semidefinite programming and representation theory...
research
07/26/2019

Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP

De Klerk, Pasechnik, and Sotirov give a semidefinite programming constra...
research
02/11/2020

Maximizing Products of Linear Forms, and The Permanent of Positive Semidefinite Matrices

We study the convex relaxation of a polynomial optimization problem, max...
research
04/14/2021

Improving Optimal Power Flow Relaxations Using 3-Cycle Second-Order Cone Constraints

This paper develops a novel second order cone relaxation of the semidefi...
research
07/13/2023

Local elimination in the traveling salesman problem

Hougardy and Schroeder (WG 2014) proposed a combinatorial technique for ...
research
04/01/2020

Instances of Computational Optimal Recovery: Refined Approximability Models

Models based on approximation capabilities have recently been studied in...

Please sign up or login with your details

Forgot password? Click here to reset