A new class of cutting planes for the symmetric travelling salesman problem
- 1 January 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 40-40 (1-3) , 225-246
- https://doi.org/10.1007/bf01580734
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- 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
- Distance conserving reductions for nonoriented networksOR Spectrum, 1983
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graphRairo-Operations Research, 1981
- A Cutting Planes Algorithm for the m-Salesmen ProblemJournal of the Operational Research Society, 1980
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- Using cutting planes to solve the symmetric Travelling Salesman problemMathematical Programming, 1978