Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a233d338ed986483

Jump to content

// Workers AI · dad joke modeWho's D. R. Fulkerson? A full person?

From Wikipedia, the free encyclopedia
(Redirected from Delbert Ray Fulkerson)
Delbert Ray Fulkerson
Born(1924-08-14)August 14, 1924
DiedJanuary 10, 1976(1976-01-10) (aged 51)
Alma materSouthern Illinois University, University of Wisconsin–Madison
Known forFord–Fulkerson algorithm
Children2 sons
AwardsLester R. Ford Award (1967)[1] of the Mathematical Association of America
Scientific career
FieldsMathematics
InstitutionsRAND Corporation, Cornell University
Cyrus MacDuffee
Doctoral students
Robert G. Bland

Delbert Ray Fulkerson (/ˈfʌlkərsən/; August 14, 1924 – January 10, 1976) was an American mathematician who co-developed the Ford–Fulkerson algorithm, one of the best-known algorithms for solving the maximum flow problem in networks.

Early life and education

[edit]

D. R. Fulkerson was born in Tamms, Illinois, the third of six children of Elbert and Emma Fulkerson. Fulkerson became an undergraduate at Southern Illinois University. His academic career was interrupted by military service during World War II. Having returned to complete his degree after the war, he went on to do a Ph.D. in mathematics at the University of Wisconsin–Madison under the supervision of Cyrus MacDuffee, who was a student of L. E. Dickson. Fulkerson received his Ph.D. in 1951.[2]

Career

[edit]

After graduation, Fulkerson joined the mathematics department at the RAND Corporation. In 1956, he and L. R. Ford Jr. described the Ford–Fulkerson algorithm.[3] In 1962 they produced a book-length description of their method.[4]

In 1971 he moved to Cornell University as the Maxwell Upson Professor of Engineering. He was diagnosed with Crohn's disease and was limited in his teaching. In despair, he committed suicide in 1976.[5]

Fulkerson was the supervisor of Jon Folkman at RAND and Tatsuo Oyama[6] at GRIPS. After Folkman committed suicide in 1969, Fulkerson blamed himself for failing to notice Folkman's suicidal behaviors.[7]

In 1979, the Mathematical Programming Society and the American Mathematical Society established the Fulkerson Prize, which is now awarded every three years for outstanding papers in discrete mathematics.[8]

See also

[edit]

References

[edit]
  1. Fulkerson, D. R. (1966). "Flow networks and combinatorial operations research" (PDF). Amer. Math. Monthly. 73 (2): 115–138. doi:10.2307/2313544. JSTOR 2313544. Archived from the original (PDF) on 2023-03-25. Retrieved 2015-02-04.
  2. "Delbert Ray Fulkerson" (PDF). library.cornell.edu. Retrieved 2014-07-01.
  3. 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, S2CID 16109790.
  4. L. R. Ford; D. R. Fulkerson (1962). Flows in Networks. Princeton, NJ: Princeton University Press. ISBN 9780691079622. {{cite book}}: ISBN / Date incompatibility (help)
  5. D. Ray Fulkerson from informs.org
  6. "OYAMA, Tatsuo | GRIPS Faculty Directory".
  7. Hoffman, Paul (1998), The Man Who Loved Only Numbers: The Story of Paul Erdős and the Search for Mathematical Truth, Hyperion, pp. 109–110, ISBN 978-0-7868-6362-4.
  8. Delbert Ray Fulkerson Prize (AMS—MOS) @ American Mathematical Society
[edit]