The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- 1 July 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 51 (1-3) , 359-400
- https://doi.org/10.1007/bf01586945
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new class of cutting planes for the symmetric travelling salesman problemMathematical Programming, 1988
- 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
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- 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 I: InequalitiesMathematical Programming, 1979
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973