Chained Lin-Kernighan for large traveling salesman problems (Q2884550)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chained Lin-Kernighan for large traveling salesman problems |
scientific article; zbMATH DE number 6039101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chained Lin-Kernighan for large traveling salesman problems |
scientific article; zbMATH DE number 6039101 |
Statements
30 May 2012
0 references
traveling salesman
0 references
heuristics
0 references
\texttt{TSPLIB}
0 references
Chained Lin-Kernighan for large traveling salesman problems (English)
0 references
0.8389101028442383
0 references
0.8310742974281311
0 references
0.8242190480232239
0 references
