The Euclidean travelling salesman problem is NP-complete
- 1 June 1977
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 4 (3) , 237-244
- https://doi.org/10.1016/0304-3975(77)90012-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the Complexity of Local Search for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973