D. R. Fulkerson
| Delbert Ray Fulkerson | |
|---|---|
 |
|
| Born |
August 14, 1924 Tamms, Illinois |
| Died | January 10, 1976 (aged 51) Ithaca, New York |
| Residence | United States |
| Nationality | American |
| Fields | Mathematics |
| Institutions | RAND Corporation, Cornell University |
| Alma mater | Southern Illinois University, University of Wisconsin–Madison |
| Doctoral advisor | Cyrus MacDuffee |
| Doctoral students | Jon Folkman, Tatsuo Oyama |
| Known for | Ford–Fulkerson algorithm |
| Notable awards | Lester R. Ford Award (1967) of the Mathematical Association of America |
| Children | 2 sons |
Delbert Ray Fulkerson (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.
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.
He was then with the mathematics department at the RAND Corporation until 1971 when he moved to Cornell University as the Maxwell Upson Professor of Engineering. He remained at Cornell until he committed suicide in 1976.
Fulkerson was the supervisor of Jon Folkman at RAND and Tatsuo Oyama[1] at GRIPS [2].
In 1956, he published his noted paper on the Ford–Fulkerson algorithm together with L.R. Ford, Jr.. 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.
...
Wikipedia