The complexity of facets resolved
- 1 January 1985
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and FacetsMathematics of Operations Research, 1980
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954