Lin-Kernighan heuristic

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Devised by Shen Lin and Brian Kernighan.

Proper noun[edit]

the Lin-Kernighan heuristic

  1. (computing theory) In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Lin-Kernighan_heuristic&oldid=77956132"