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 this page instead for the normal view: A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One |
scientific article |
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