The adjacency relation on the traveling salesman polytope is NP-Complete

This publication has 20 references indexed in Scilit:

• The Planar Hamiltonian Circuit Problem is NP-Complete
  SIAM Journal on Computing, 1976
• Facets of the knapsack polytope
  Mathematical Programming, 1975
• On certain polytopes associated with graphs
  Journal of Combinatorial Theory, Series B, 1975
• On the Computational Complexity of Combinatorial Problems
  Networks, 1975
• Some simplified NP-complete problems
  Published by Association for Computing Machinery (ACM) ,1974
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
  Operations Research, 1973
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• Matroids and the greedy algorithm
  Mathematical Programming, 1971
• The Traveling Salesman Problem: A Survey
  Operations Research, 1968
• Computer Solutions of the Traveling Salesman Problem
  Bell System Technical Journal, 1965