OurBigBook About$ Donate
 Sign in Sign up

Lin–Kernighan heuristic

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Combinatorial algorithms
 0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (6)

  1. Combinatorial algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook