Good triangulations yield good tours

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 638-647

  Letchford, Adam N ^a   Pearson, Nicholas A ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Delaunay triangulation; Traveling salesman problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; MOTIVATION; SCHEDULING; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

COMPUTATIONAL RESULTS; DELAUNAY TRIANGULATION; EUCLIDEAN; EUCLIDEAN TSP; GREEDY TRIANGULATIONS; MACHINE SCHEDULING; PLANAR GRAPH; TOURS;

TRIANGULATION;

EID: 34447095802     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.03.025     Document Type: Article

References (38)

1. Lawler E.L., Lenstra J.K., Rinnooy-Kan A.H.G., and Schmoys D.B. The traveling salesman problem (1985), Wiley, New York
2. Naddef D. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin G, Punnen A, editors. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers. 2002.
3. Garey M.R., Graham R.L., and Johnson D.S. Some NP-complete geometric problems. Proceedings of the eighth ACM STOC (1976) 10-22
4. Garey M.R., Johnson D.S., and Tarjan R.E. The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing 5 (1976) 704-714
5. Reinelt G. Fast heuristics for large geometric traveling salesman problems. ORSA Journal on Computing 4 (1992) 206-217
6. Stewart WR. Euclidean traveling salesman problems and Voronoi diagrams. Working paper, School of Business Administration, College of William and Mary. Williamsburg, VA23185; 1997.
7. Cornuéjols G., Fonlupt J., and Naddef D. The traveling salesman on a graph and some related integer polyhedra. Mathematical Programming 33 (1985) 1-27
8. Fleischmann B. A cutting plane procedure for the traveling salesman problem on a road network. European Journal of Operational Research 21 (1985) 307-317
9. Papadimitriou C.H., and Yannakakis M. The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993) 1-11
10. Arora S. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Journal of the ACM 45 (1998) 753-782
11. Held M., and Karp R. A dynamic programming approach to sequencing problems. SIAM Journal 10 (1962) 196-209
12. Smith WD. Finding the optimum N-city traveling salesman tour in the Euclidean plane in subexponential time and polynomial space. Unpublished manuscript; 1988.
13. Arora S., Grigni M., Karger D., Klein P., and Woloszyn A. A polynomial-time approximation scheme for weighted planar graph TSP. Proceedings of the ninth annual ACM-SIAM SODA (1998) 33-41
14. Deineko V.G., Klinz B., and Woeginger G.J. Exact algorithms for the Hamiltonian cycle problem in planar graphs. Operations Research Letters 34 (2006) 269-274
15. Fleischer L., and Tardos E. Separating maximally violated comb inequalities in planar graphs. Mathematics of Operations Research 24 (1999) 130-148
16. Letchford A.N. Separating a superclass of comb inequalities in planar graphs. Mathematics of Operations Research 25 (2000) 443-454
17. Letchford AN, Pearson NA. Exploiting planarity in separation routines for the symmetric traveling salesman problem. Working paper, Department of Management Science, Lancaster University; 2005, submitted for publication.
18. Rosenkrantz D.J., Stearns R.E., and Lewis P.M. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6 (1977) 563-581
19. Burkard R.E., Deineko V.G., and Woeginger G.J. The travelling salesman and the PQ-tree. Mathematics of Operations Research 23 (1998) 613-623
20. Voronoi G. Nouvelles applications des paramétres continus á la théorie des formes quadratiques, Deuxiéme memoire: Recherche sur les parallélloédres primitifs. Journal für Reine und Angewandte Mathematik 3 (1908) 198-287
21. Delaunay B. Sur la sphére vide, Izvestia Akademia Nauk. SSSr, VII Seria. Otdelenie Matemtischeskii i Estestvennyka Nauk 7 (1934) 793-800
22. Okabe A., Boots B., Sugihara K., and Chiu S.N. Spatial tessellations: concepts and applications of Voronoi diagrams (1992), Wiley, Chichester
23. Preparata F.P., and Shamos M.I. Computational geometry: an introduction (1985), Springer, New York
24. Toussaint G.T. The relative neighborhood graph of a finite planar set. Pattern Recognition 12 (1980) 261-268
25. Gabriel K.R., and Sokal R.R. A new statistical approach to geographic variation analysis. Systematic Zoology 18 (1969) 259-278
26. Baker T.J. Three dimensional mesh generation by triangulation of arbitrary point sets. Proceedings of the AIAA eighth computational fluid dynamics conference (1987)
27. Keil J.M., and Gutwin C.A. The Delaunay triangulation closely approximates the complete graph. Discrete & Computational Geometry 7 (1992) 13-28
28. Chew L.P. There are graphs almost as good as the complete graph. Journal of Computer and System Sciences 39 (1989) 205-219
29. Dillencourt M.B. A non-Hamiltonian Delaunay triangulation. Information Processing Letters 25 (1987) 149-151
30. Dillencourt MB. Finding Hamiltonian cycles in Delaunay triangulations is NP-complete. In: Proceedings of the fourth conference on computational geometry. Canada; 1994.
31. Genoud T. Etude du caractère hamiltonien de Delaunays aléatoires. Working Paper. Ecole Polytechnique Federale de Lausanne, Switzerland; 1989.
32. Levcopoulos C., and Krznaric D. The greedy triangulation can be computed from the Delaunay triangulation in linear time. Computational Geometry, Theory and Applications 14 (1999) 197-220
33. Levcopoulos C. Private communication; December 2005.
34. Das G, Joseph D. Which triangulations approximate the complete graph? In: Proceedings of the international symposium on optimal algorithms. Lecture notes in computer science, vol. 401. Berlin: Springer; 1989. p. 168-83.
35. Manacher G.K., and Zobrist A.L. Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation. Information Processing Letters 9 (1979) 31-34
36. Lingas A. The greedy and Delaunay triangulations are not bad in the average case. Information Processing Letters 22 (1986) 25-31
37. Reinelt G. TSPLIB-a traveling salesman problem library. ORSA Journal on Computing 3 (1991) 376-385
38. Gutin G., and Punnen A. The traveling salesman problem and its variations (2002), Kluwer Academic Publishers, Dordrecht