A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

Natural Sciences, Computer Science, Mathematics +6

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5.1K citations · Full text

Natural Sciences, Mathematics, Algebra +11

Shortest Connection Networks And Some Generalizations

R. C. Prim · Bell System Technical Journal · 1957 · 4.6K citations

Computing, Computer Science, Interconnection Networks +9

Computer Solutions of the Traveling Salesman Problem

Shen Lin · Bell System Technical Journal · 1965 · 2K citations

Computing, Computer Science, Algorithms +12

The Traveling-Salesman Problem and Minimum Spanning Trees

Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations

Natural Sciences, Computer Science, Mathematics +17