The \(k\)-Opt algorithm for the traveling salesman problem has exponential running time for \(k\geq 5\) (Q6875112)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8144546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(k\)-Opt algorithm for the traveling salesman problem has exponential running time for \(k\geq 5\) |
scientific article; zbMATH DE number 8144546 |
Statements
The \(k\)-Opt algorithm for the traveling salesman problem has exponential running time for \(k\geq 5\) (English)
0 references
14 January 2026
0 references
traveling salesman problem
0 references
\(k\)-Opt algorithm
0 references
PLS-completeness
0 references
