Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem

Integer and Combinatorial Optimization

H. P. Williams, George L. Nemhauser, Laurence A. Wolsey · Journal of the Operational Research Society · 1990 · 5.5K citations

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

Journal of the Operational Research Society · 1986 · 1.7K citations

Approximation Algorithms for Some Routing Problems

Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim · SIAM Journal on Computing · 1978 · 419 citations

Mathematical Programming, Engineering, Computational Complexity +21

Analysis of Christofides' heuristic: Some paths are more difficult than cycles

J.A. Hoogeveen · Operations Research Letters · 1991 · 192 citations

Heuristic Search, Heuristic (Computer Science)

The clustered traveling salesman problem

James A. Chisman · Computers & Operations Research · 1975 · 190 citations

Engineering, Traveling Salesman Problem, Combinatorial Problem +7