Solution of large-scale symmetric travelling salesman problems
- 1 July 1991
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 51 (1-3), 141-202
- https://doi.org/10.1007/bf01586932
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- A cutting plane algorithm for minimum perfect 2-matchingsComputing, 1987
- 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
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- A man-machine approach toward solving the traveling salesman problemCommunications of the ACM, 1971
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961