Lower and upper bounds for the m-peripatetic vehicle routing problem

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

Future paths for integer programming and links to artificial intelligence

Fred Glover · Computers & Operations Research · 1986 · 4.1K citations

Natural Sciences, Computer Science, Mathematics +16

Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

Graham Clarke, J. W. Wright · Operations Research · 1964 · 3.8K citations

Management, Industrial Engineering, Operations Management +17

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

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