The traveling-salesman problem and minimum spanning trees: Part II
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
A note on two problems in connexion with graphs
1959 • 22,492 citations
On the shortest spanning subtree of a graph and the traveling salesman problem
1956 • 4,806 citations
Computer Solutions of the Traveling Salesman Problem
1965 • 1,952 citations
A Method for Solving Traveling-Salesman Problems
1958 • 1,449 citations
The Traveling-Salesman Problem and Minimum Spanning Trees
1970 • 1,431 citations
Solution of a Large-Scale Traveling-Salesman Problem
2009 • 1,314 citations
A Dynamic Programming Approach to Sequencing Problems
1962 • 1,212 citations
The Relaxation Method for Linear Inequalities
1954 • 562 citations
The Relaxation Method for Linear Inequalities
1954 • 454 citations
The Traveling Salesman Problem: A Survey
1968 • 389 citations
The Traveling Salesman Problem: A Survey
1976 • 381 citations
A Heuristic Approach to Solving Travelling Salesman Problems
1964 • 207 citations
Optimal assignments in an ordered set: An application of matroid theory
1968 • 153 citations