On the nearest neighbor rule for the traveling salesman problem

Operations Research Letters

Volumn 32, Issue 1, 2004, Pages 1-4

  Hurkens, Cor A J ^a   Woeginger, Gerhard J ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Heuristic; Lower bound; Traveling salesman problem

Indexed keywords

GRAPH THEORY; OPTIMIZATION; THEOREM PROVING;

COMBINATORIAL OPTIMIZATION;

TRAVELING SALESMAN PROBLEM;

EID: 0142061566     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00093-2     Document Type: Article

References (4)

1. Cutler M. Efficient special case algorithms for the. N -line planar traveling salesman problem Networks. 10:1980;183-195.
2. D.S. Johnson, C.H. Papadimitriou, Performance guarantees for heuristics, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985, pp. 145-180 (Chapter 5).
3. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985.
4. Rosenkrantz D.J., Stearns R.E., Lewis II P.M. An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6:1977;563-581.