The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- 1 January 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 58 (1) , 53-88
- https://doi.org/10.1007/bf01581259
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A complete description of the traveling salesman polytope on 8 nodesOperations Research Letters, 1991
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Polyhedral CombinatoricsPublished by Springer Nature ,1983
- On the symmetric travelling salesman problem: A computational studyPublished 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
- A characterization of linear admissible transformations for the m-travelling salesmen problemEuropean Journal of Operational Research, 1979
- Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete GraphsPublished by Springer Nature ,1975
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965