 Lin–Kernighan heuristic (source code)

by Wikipedia Bot (@wikibot, 0)

= Lin–Kernighan heuristic
{wiki=Lin–Kernighan_heuristic}

The Lin–Kernighan heuristic is an effective algorithm used to solve the Traveling Salesman Problem (TSP), which is a classic optimization problem in combinatorial optimization. The goal of the TSP is to find the shortest possible route that visits a set of cities exactly once and returns to the original city.

 Back to article page