Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
Abstract
References
Index Terms
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
Recommendations
On Semidefinite Programming Relaxations of the Traveling Salesman Problem
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 Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
We study a semidefinite programming relaxation of the traveling salesman problem introduced by de Klerk, Pasechnik, and Sotirov [SIAM J. Optim., 19 (2008), pp. 1559--1573] and show that their relaxation has an unbounded integrality gap. In particular, we ...
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
We consider the integrality gap of the subtour linear program (LP) relaxation of the traveling salesman problem (TSP) restricted to circulant instances. De Klerk and Dobre [Discrete Appl. Math., 159 (2011), pp. 1815--1826] conjectured that the value of ...
Comments
Information & Contributors
Information
Published In
Publisher
INFORMS
Linthicum, MD, United States
Publication History
Author Tag
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in