Optimizing over the subtour polytope of the travelling salesman problem
- 1 November 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 49 (1-3) , 163-187
- https://doi.org/10.1007/bf01588786
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMathematics of Operations Research, 1986
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970