Construct · 1 fields · 1 citations

Lin-Kernighan heuristic: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Operations research

local search heuristic for the traveling salesman problem that performs variable-depth sequences of edge exchanges to shorten a tour.

In operations research, Lin-Kernighan heuristic refers to local search heuristic for the traveling salesman problem that performs variable-depth sequences of edge exchanges to shorten a tour. This meaning comes from Lin (1973) in Operations Research.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Lin-Kernighan heuristic sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

edge5 fields · 5 citationsjingle · one word, five constructs heuristic4 fields · 4 citationsjingle · one word, four constructs operation1 fields · 1 citationsanchor · a standalone construct

References

Lin, S., & Kernighan, B. W. (1973). An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21(2), 498-516. https://doi.org/10.1287/opre.21.2.498

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct