Survey of facial results for the traveling salesman polytope
Authors:
- 1 April 1998
- journal article
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 27 (8) , 11-27
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- The graphical relaxation: A new framework for the symmetric traveling salesman polytopeMathematical Programming, 1993
- 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
- Classification of travelling salesman problem formulationsOperations Research Letters, 1990
- Branch-and-cut approach to a variant of the traveling salesman problemJournal of Guidance, Control, and Dynamics, 1988
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- A cutting plane procedure for the travelling salesman problem on road networksEuropean Journal of Operational Research, 1985
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965