Lin–Kernighan heuristic
id:
lin-kernighan-heuristic-257-8382178
title:
Lin–Kernighan heuristic
text:
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the symmetric travelling salesman problem. It belongs to the class of local search algorithms, which take a tour as part of the input and attempt to improve it by searching in the neighbourhood of the given tour for one that is shorter, and upon finding one repeats the process from that new one, until encountering a local minimum. As in the case of the related 2-opt and 3-opt algorithms, the relevant measure o
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Lin%E2%80%93Kernighan_heuristic
date created:
date modified:
2023-07-11T05:15:20Z
main entity:
{"identifier":"Q2835802","url":"https://www.wikidata.org/entity/Q2835802"}
image:
fields total:
13
integrity:
13