On the history of the shortest path problem (Q1946017): Difference between revisions

This paper looks at the history of a variety of shortest path problems. While the author mentions some primitive societies, he deals mainly with the nineteenth and twentieth centuries. A diversity of techniques and approaches are discussed including matrix methods, linear programming, and ideas from Bellman, Ford, Dantzig, Dijkstra and a group of researchers at the Case Institute of Technology.