A modified Lin--Kernighan traveling-salesman heuristic (Q688925): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4038710 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank | |||
Normal rank | |||
Revision as of 10:30, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified Lin--Kernighan traveling-salesman heuristic |
scientific article |
Statements
A modified Lin--Kernighan traveling-salesman heuristic (English)
0 references
1 November 1993
0 references
depth search
0 references
2-OPT
0 references
Lin-Kernighan traveling-salesman heuristic
0 references
