A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126)
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: A diagonal completion and 2-optimal procedure for the travelling salesman problem |
scientific article; zbMATH DE number 4131982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A diagonal completion and 2-optimal procedure for the travelling salesman problem |
scientific article; zbMATH DE number 4131982 |
Statements
A diagonal completion and 2-optimal procedure for the travelling salesman problem (English)
0 references
1990
0 references
fast diagonal completion algorithm
0 references
travelling salesman
0 references
2-optimal method
0 references
0 references
0.88753575
0 references
0.8770824
0 references
0 references
0.87230873
0 references
0.8676355
0 references
0.86698556
0 references
0.86543286
0 references
0.8653881
0 references
