3-opt

From Wikipedia, the free encyclopedia

In optimization, 3-opt is a simple local search algorithm for solving the traveling salesman problem and related network optimization problems .

[edit] See also

[edit] References

    • F. BOCK (1965). An algorithm for solving traveling-salesman and related network optimization problems. unpublished manuscript associated with talk presented at the 14th ORSA National Meeting. 
    • S. LIN (1965). Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245-2269.. 
    • 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 mathematics-related article is a stub. You can help Wikipedia by expanding it.
    Retrieved from "http://en.wikipedia.org../../../3/-/o/3-opt.html"