Home > Research > Publications & Outputs > Good triangulations yield good tours

Electronic data


Text available via DOI:

View graph of relations

Good triangulations yield good tours

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2008
<mark>Journal</mark>Computers and Operations Research
Issue number2
Number of pages10
Pages (from-to)638-647
Publication StatusPublished
<mark>Original language</mark>English


Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give several motivations for considering this heuristic, along with extensive computational results. It turns out that the Delaunay and greedy triangulations make effective choices for the induced planar graph. Indeed, our experiments show that the resulting tours are on average within 0.1% of optimality.