The Euclidean traveling salesman problem is NP-complete (Q1250163)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Euclidean traveling salesman problem is NP-complete |
scientific article |
Statements
The Euclidean traveling salesman problem is NP-complete (English)
0 references
1977
0 references
