Integer programming approaches to the travelling salesman problem
- 1 December 1976
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 10 (1), 367-378
- https://doi.org/10.1007/bf01580682
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- 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