K-opt

From Wikipedia, the free encyclopedia

In optimization, k-opt is a generalization of the local search algorithms, 2-opt and 3-opt that are used for solving the traveling salesman problem and related network optimization problems.

[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

Image:Mathapplied-stub_ico.png This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../k/-/o/K-opt.html"