Efficiency of a local algorithm for solving the traveling salesman problem (Q916576)
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: Efficiency of a local algorithm for solving the traveling salesman problem |
scientific article; zbMATH DE number 4154238
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiency of a local algorithm for solving the traveling salesman problem |
scientific article; zbMATH DE number 4154238 |
Statements
Efficiency of a local algorithm for solving the traveling salesman problem (English)
0 references
1988
0 references
comparison of algorithms
0 references
local steepest descent algorithms
0 references
traveling salesman
0 references
Sarvanov-Doroshko algorithm
0 references
Hamiltonian circuit
0 references
complete symmetric digraphs
0 references
0.90156287
0 references
0 references
0.8904691
0 references
0.8867217
0 references
0.8854548
0 references
