Approximation results toward nearest neighbor heuristic

Yugoslav Journal of Operations Research

Volumn 12, Issue 1, 2002, Pages 11-16

  Monnot, Jérôme ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

Analysis of algorithms; Approximate algorithms; Performance ratio; Traveling salesman problem

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PERFORMANCE; TRAVELING SALESMAN PROBLEM;

ANALYSIS OF ALGORITHMS; APPROXIMATE ALGORITHMS; NEAREST NEIGHBOR (NN); PERFORMANCE RATIO;

APPROXIMATION THEORY;

EID: 7444225571     PISSN: 03540243     EISSN: None     Source Type: Journal    
DOI: 10.2298/YJOR0201011M     Document Type: Article

References (8)

1. Arora, S., "Polynomial time approximation scheme for Euclidian TSP and other geometric problems", Proc. F.O.C.S. 1996, 2-11.
2. Christofides, N., "Worst-case analysis of a new heuristic for the traveling salesman problem", Technical report 338, Grad. School of Industrial Administration, CMU, 1976.
3. Engebretsen, L., and Karpinski, M., "Approximation hardness of TSP with bounded matrices", E.C.C.C. Report TR00-089, 2000.
4. Fisher, M.I., Nemhauser, G.L., and Wolsey, L.A., "An analysis of approximations for finding a maximum weight Hamiltonian circuit", Op. Res., 27 (4) (1979) 799-809.
5. Karg, L.L., and Thompson, G.L., "A heuristic approach to traveling salesman problems", Management Sci., 10 (1964) 225-248.
6. Papadimitriou, C.H., and Vempala, S., "On the approximability of the traveling salesman problem", Proc. S.T.O.C. 2000, 2000.
7. Papadimitriou, C.H., and Yannakakis, M., "The traveling salesman problem with distance one and two", Math. Oper. Res., 18 (1993) 1-11.
8. Rosenkrantz, D.J., Stearns, R.E., and Lewis, P.M., "An analysis of several heuristics for the traveling salesman problem", S.I.A.M. J. Comp., 6 (1977) 563-581.