On the history of the shortest path problem (Q1946017)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6155087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the history of the shortest path problem |
scientific article; zbMATH DE number 6155087 |
Statements
On the history of the shortest path problem (English)
0 references
17 April 2013
0 references
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.
0 references
shortest path
0 references
history
0 references
algorithm
0 references
0.7639357447624207
0 references
0.7613755464553833
0 references
0.7612566351890564
0 references
0.7548753023147583
0 references
