Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
- 1 December 1974
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 7 (1) , 87-96
- https://doi.org/10.1007/bf01585505
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Algorithms 402: Increasing the efficiency of quicksortCommunications of the ACM, 1970
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956