A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (Q3937162): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:30, 5 February 2024
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
