A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (Q3937162)
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 3754431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One |
scientific article; zbMATH DE number 3754431 |
Statements
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (English)
0 references
1982
0 references
traveling salesman problem
0 references
minimal tour length
0 references
probabilistic algorithm
0 references
