On the history of the shortest path problem

MaRDI QIDQ1946017zbMATH OpenFDO

Authors Alexander Schrijver

Publication date 17 April 2013

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/DMJDMV/vol-ismp/32_schrijver-alexander-sp.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmhistoryshortest path

Mathematics Subject Classification ID

History of mathematics in the 19th century (01A55) History of mathematics in the 20th century (01A60) History of combinatorics (05-03) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 6152371
• Letter to the editor: A variant on the shortest-route problem
• On the History of Combinatorial Optimization (Till 1960)
• Extracts from the history of combinatorial optimization
• Shortest path algorithms

Cited in

(12)

• Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits
• Manifold-based material field series expansion method for topology optimization on free-form surfaces
• Mathematical modeling for equipment updating based on shortest path
• Extracts from the history of combinatorial optimization
• Relax-and-split method for nonconvex inverse problems
• Letter to the editor: A variant on the shortest-route problem
• Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
• How to do a half-turn in the cyclic tower of Hanoi
• Shortest paths without a map, but with an entropic regularizer
• An enhanced pricing model for truck transportation: a case study in Swedish forestry
• Robust and distributionally robust shortest path problems: a survey
• Search for shortest paths based on a projective description of unweighted graphs

This page was built for publication: On the history of the shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946017)