The traveling salesman problem: A duality approach
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 13 (1), 221-237
- https://doi.org/10.1007/bf01584338
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Note—On the Use of Fictitious Bounds in Tree Search AlgorithmsManagement Science, 1977
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- 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 and Minimum Spanning TreesOperations Research, 1970
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959