Facet identification for the symmetric traveling salesman polytope
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1-3) , 219-257
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A cutting plane algorithm for minimum perfect 2-matchingsComputing, 1987
- A construction for binary matroidsDiscrete Mathematics, 1987
- Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMathematics of Operations Research, 1986
- Solving matching problems with linear programmingMathematical Programming, 1985
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- Multi-terminal vehicle-dispatch algorithmOmega, 1976
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961