This article needs attention from an expert in Mathematics. The specific problem is: "This page is very poor in terms of contents. No pseudo-code, scarce references. This algorithm deserves a lot better description and treatment.". WikiProject Mathematics may be able to help recruit an expert. (September 2016)

See also

• 2-opt
• Local search (optimization)
• Lin–Kernighan heuristic

References

• BOCK, F. (1958). "An algorithm for solving traveling-salesman and related network optimization problems". Operations Research. 6 (6).
• Lin, Shen (1965). "Computer Solutions of the Traveling Salesman Problem". Bell System Technical Journal. 44 (10). Institute of Electrical and Electronics Engineers (IEEE): 2245–2269. doi: 10.1002/j.1538-7305.1965.tb04146.x. ISSN  0005-8580.
• Lin, S.; Kernighan, B. W. (1973). "An Effective Heuristic Algorithm for the Traveling-Salesman Problem". Operations Research. 21 (2). Institute for Operations Research and the Management Sciences (INFORMS): 498–516. doi: 10.1287/opre.21.2.498. ISSN  0030-364X.
• Sipser, Michael (2006). Introduction to the theory of computation. Boston: Thomson Course Technology. ISBN  0-534-95097-3. OCLC  58544333.