Lin-Kernighan
From Wikipedia, the free encyclopedia
In optimization, the Lin-Kernighan algorithm is one of the best heuristics for the Euclidean traveling salesman problem.
[edit] See also
[edit] References
- S. Lin and B. W. Kernighan (1973). An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Res. 21, 498-516..