The adjacency relation on the traveling salesman polytope is NP-Complete
- 1 December 1978
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 14 (1), 312-324
- https://doi.org/10.1007/bf01588973
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- Facets of the knapsack polytopeMathematical Programming, 1975
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Some simplified NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1974
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Matroids and the greedy algorithmMathematical Programming, 1971
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965