See Lin-Kernighan heuristic on Wiktionary
{
"etymology_text": "Devised by Shen Lin and Brian Kernighan.",
"forms": [
{
"form": "the Lin-Kernighan heuristic",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Lin-Kernighan heuristic",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [],
"source": "w"
}
],
"glosses": [
"In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour."
],
"id": "en-Lin-Kernighan_heuristic-en-name--X4AhAd1",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"combinatorial",
"combinatorial"
],
[
"optimization",
"optimization"
],
[
"heuristic",
"heuristic"
],
[
"symmetric",
"symmetric"
],
[
"travelling salesman problem",
"travelling salesman problem"
],
[
"swap",
"swap"
],
[
"subtour",
"subtour"
],
[
"tour",
"tour"
]
],
"raw_glosses": [
"(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."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Lin-Kernighan heuristic"
]
}
],
"word": "Lin-Kernighan heuristic"
}
{
"etymology_text": "Devised by Shen Lin and Brian Kernighan.",
"forms": [
{
"form": "the Lin-Kernighan heuristic",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Lin-Kernighan heuristic",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"combinatorial",
"combinatorial"
],
[
"optimization",
"optimization"
],
[
"heuristic",
"heuristic"
],
[
"symmetric",
"symmetric"
],
[
"travelling salesman problem",
"travelling salesman problem"
],
[
"swap",
"swap"
],
[
"subtour",
"subtour"
],
[
"tour",
"tour"
]
],
"raw_glosses": [
"(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."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Lin-Kernighan heuristic"
]
}
],
"word": "Lin-Kernighan heuristic"
}
Download raw JSONL data for Lin-Kernighan heuristic meaning in All languages combined (1.4kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-06-05 from the enwiktionary dump dated 2025-06-01 using wiktextract (5ee713e and f1c2b61). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.