Using cutting planes to solve the symmetric Travelling Salesman problem
- 1 December 1978
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 15 (1) , 177-188
- https://doi.org/10.1007/bf01609016
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Integer programming approaches to the travelling salesman problemMathematical Programming, 1976
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman ProblemOperations Research, 1959