Hard to Solve Instances of the Euclidean Traveling Salesman Problem

@article{Hougardy2018HardTS,
  title={Hard to Solve Instances of the Euclidean Traveling Salesman Problem},
  author={Stefan Hougardy and Xianghui Zhong},
  journal={ArXiv},
  year={2018},
  volume={abs/1808.02859}
}
  • Stefan Hougardy, Xianghui Zhong
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
  • The well known $4/3$ conjecture states that the integrality ratio of the subtour LP is at most $4/3$ for metric Traveling Salesman instances. We present a family of Euclidean Traveling Salesman instances for which we prove that the integrality ratio of the subtour LP converges to $4/3$. These instances (using the rounded Euclidean norm) turn out to be hard to solve exactly with Concorde, the fastest existing exact TSP solver. For a 200 vertex instance from our family of Euclidean Traveling… CONTINUE READING
    3
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES