The Euclidean traveling salesman problem is NP-complete (Q1250163)
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: The Euclidean traveling salesman problem is NP-complete |
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
