D. R. Fulkerson

From Wikipedia, the free encyclopedia
  (Redirected from Delbert Ray Fulkerson)
Jump to navigation Jump to search
Delbert Ray Fulkerson
Delbert Ray Fulkerson.png
Born(1924-08-14)August 14, 1924
DiedJanuary 10, 1976(1976-01-10) (aged 51)
ResidenceUnited States
NationalityAmerican
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
Doctoral advisorCyrus MacDuffee
Doctoral studentsJon Folkman, 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 most well-known algorithms to solve 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]

He was then with 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[1] at GRIPS [2].

In 1979, the renowned Fulkerson Prize was established which is now awarded every three years for outstanding papers in discrete mathematics jointly by the Mathematical Programming Society and the American Mathematical Society.

See also[edit]

References[edit]

  1. ^ Fulkerson, D. R. (1966). "Flow networks and combinatorial operations research" (PDF). Amer. Math. Monthly. 73: 115–138. doi:10.2307/2313544.
  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.
  4. ^ L. R. Ford; D. R. Fulkerson (1962). Flows in Networks. Princeton, NJ: Princeton University Press.
  5. ^ D. Ray Fulkerson from informs.org

External links[edit]