Searching for CITATIONS to document sorted by Number of Citations:
An effective heuristic algorithm for the traveling salesman problem
(1973)
by S Lin, B W Kernighan
Operations Research
Add To MetaCart
154 citations found, showing 1 through 10.
Next 10 →
-
Ant Colony System: A cooperative learning approach to the traveling salesman problem
- Cited by 376 (41 self) – Show/Hide Context – Add To MetaCart
-
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems
- Cited by 224 (3 self) – Show/Hide Context – Add To MetaCart
-
Local search heuristics for k-median and facility location problems
- Cited by 130 (5 self) – Show/Hide Context – Add To MetaCart
-
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts - Towards Memetic Algorithms
- Cited by 108 (10 self) – Show/Hide Context – Add To MetaCart
-
Optimal Composition of Real-Time Systems
- Cited by 98 (19 self) – Show/Hide Context – Add To MetaCart
-
Large-Step Markov Chains for the Traveling Salesman Problem
- Cited by 78 (6 self) – Show/Hide Context – Add To MetaCart
-
Operational Rationality through Compilation of Anytime Algorithms
- Cited by 77 (17 self) – Show/Hide Context – Add To MetaCart
-
Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
- Cited by 77 (4 self) – Show/Hide Context – Add To MetaCart
-
Combining Simulated Annealing with Local Search Heuristics
- Cited by 73 (7 self) – Show/Hide Context – Add To MetaCart
-
The Quadratic Assignment Problem: A Survey and Recent Developments
- Cited by 70 (15 self) – Show/Hide Context – Add To MetaCart
