# Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem

@article{Gutekunst2019CharacterizingTI, title={Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem}, author={Samuel C. Gutekunst and David P. Williamson}, journal={ArXiv}, year={2019}, volume={abs/1902.06808} }

- Published in ArXiv 2019

We consider the integrality gap of the subtour LP relaxation of the Traveling Salesman Problem restricted to circulant instances. De Klerk and Dobre conjectured that the value of the optimal solution to the subtour LP on these instances is equal to an entirely combinatorial lower bound from Van der Veen, Van Dal, and Sierksma. We prove this conjecture by giving an explicit optimal solution to the subtour LP. We then use it to show that the integrality gap of the subtour LP is 2 on circulant… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 44 REFERENCES

## Efficiently solvable special cases of bottleneck travelling salesman problems

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## A comparison of lower bounds for the symmetric circulant traveling salesman problem

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## The Symmetric Circulant Traveling Salesman Problem

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## The Traveling Salesman Problem in Circulant Weighted Graphs With Two Stripes

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Bounds for the symmetric circulant traveling salesman problem

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Small Travelling Salesman Polytopes

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL