Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem (Q4337735)
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: Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem |
scientific article; zbMATH DE number 1013287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem |
scientific article; zbMATH DE number 1013287 |
Statements
Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem (English)
0 references
26 May 1997
0 references
Euclidean traveling salesman problem
0 references
nearest neighbor tours
0 references
worst case analysis
0 references
0.830100417137146
0 references
0.8136358857154846
0 references
0.7936102151870728
0 references
