Lin-Kernighan

From Wikipedia, the free encyclopedia

 Please help improve this article or section by expanding it.
Further information might be found on the talk page or at requests for expansion. (January 2007)

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. 

[edit] External links


This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.