Hamiltonian path and symmetric travelling salesman polytopes
- 1 January 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 58 (1-3) , 89-110
- https://doi.org/10.1007/bf01581260
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The graphical relaxation: A new framework for the symmetric traveling salesman polytopeMathematical Programming, 1993
- The equipartition polytope. I: Formulations, dimension and basic facetsMathematical Programming, 1990
- 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
- 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
- Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete GraphsPublished by Springer Nature ,1975
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964