Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311)
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: Fast Algorithms for Geometric Traveling Salesman Problems |
scientific article; zbMATH DE number 109094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Algorithms for Geometric Traveling Salesman Problems |
scientific article; zbMATH DE number 109094 |
Statements
Fast Algorithms for Geometric Traveling Salesman Problems (English)
0 references
25 February 1993
0 references
approximate traveling salesman tours
0 references
multidimensional point sets
0 references
starting heuristics
0 references
uniform planar million-city traveling salesman
0 references
0.9588725
0 references
0.9246089
0 references
0.9001287
0 references
0.89913243
0 references
0.89336884
0 references
0.8931069
0 references
0.8899413
0 references
