Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem

by   Xianghui Zhong, et al.

In this paper we investigate instances with high integrality ratio of the subtour LP. We develop a procedure to generate families of Euclidean TSP instances whose integrality ratios converge to 4/3 and may have a different structure than the instances currently known from the literature. Moreover, we compute the instances maximizing the integrality ratio for Rectilinear TSP with up to 10 vertices. Based on these instances we give families of instances whose integrality ratio converge to 4/3 for Rectilinear, Multidimensional Rectilinear and Euclidean TSP that have similar structures. We show that our instances for Multidimensional Rectilinear TSP and the known instances for Metric TSP maximize the integrality ratio under certain assumptions. We also investigate the concept of local optimality with respect to integrality ratio and develop several algorithms to find instances with high integrality ratio. Furthermore, we describe a family of instances that are hard to solve in practice. The currently fastest TSP solver Concorde needs more than two days to solve an instance from the family with 52 vertices.



There are no comments yet.


page 1

page 2

page 3

page 4


Hard to Solve Instances of the Euclidean Traveling Salesman Problem

The well known 4/3 conjecture states that the integrality ratio of the s...

The asymmetric traveling salesman path LP has constant integrality ratio

We show that the classical LP relaxation of the asymmetric traveling sal...

Branching Strategy Selection Approach Based on Vivification Ratio

The two most effective branching strategies LRB and VSIDS perform differ...

A performance study of some approximation algorithms for minimum dominating set in a graph

We implement and test the performances of several approximation algorith...

Simplex based Steiner tree instances yield large integrality gaps for the bidirected cut relaxation

The bidirected cut relaxation is the characteristic representative of th...

Explicit SoS lower bounds from high-dimensional expanders

We construct an explicit family of 3XOR instances which is hard for O(√(...

An Efficient Metric of Automatic Weight Generation for Properties in Instance Matching Technique

The proliferation of heterogeneous data sources of semantic knowledge ba...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.