A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (Q3937162): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: John H. Halton / rank | |||
| Property / author | |||
| Property / author: John H. Halton / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055038236 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:56, 20 March 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
