Jump to content

L. R. Ford Jr.

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by KasparBot (talk | contribs) at 03:12, 18 May 2015 (embed authority control with wikidata information). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Not to be confused with Lester R. Ford, Sr..

Lester Randolph Ford, Jr. (born September 23, 1927, Houston) is an American mathematician specializing in network flow problems. He is the son of mathematician Lester R. Ford, Sr..[1]

Ford's paper with D. R. Fulkerson on the maximum flow problem and the Ford–Fulkerson algorithm for solving it, published as a technical report in 1954 and in a journal in 1956, established the max-flow min-cut theorem.[2][3] Ford also developed the Bellman–Ford algorithm for finding shortest paths in graphs that have negatively weighted edges before Bellman.

References

  1. ^ O'Connor, John J.; Robertson, Edmund F., "Lester Randolph Ford", MacTutor History of Mathematics Archive, University of St Andrews
  2. ^ Ford, L. R., Jr.; Fulkerson, D. R. (1956), "Maximal flow through a network" (PDF), Canadian Journal of Mathematics, 8: 399–404, doi:10.4153/cjm-1956-045-5, MR 0079251{{citation}}: CS1 maint: multiple names: authors list (link).
  3. ^ Gass, Saul I.; Assad, Arjang (2005), "1954 Max-flow min-cut theorem", An annotated timeline of operations research: an informal history, International series in operations research & management science, vol. 75, Springer-Verlag, p. 96, ISBN 978-1-4020-8112-5.

Template:Persondata


Flag of United StatesScientist icon

This article about an American mathematician is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=L._R._Ford_Jr.&oldid=662875702"