IFORS' Operational Research Hall of Fame

Delbert Ray Fulkerson’s seminal work in network flows, large-scale linear programming, and combinatorial optimization have had an enormous influence on the practice of OR. Ray, as his friends called him, was a mathematician at heart. He loved the elegance and grace of mathematics, and he loved good mathematics for its own sake. Much of his most influential work began with an application, a puzzle, or a specific computational obstacle. Pursuit of the underlying mathematical structures led Ray and his collaborators to profoundly broad methodological innovations, which included cutting planes, column generation, and the foundations of network flow theory. The seeds of branch-and-bound and polyhedral combinatorics can also be found in this work. Awards: Lester R. Ford Award, Mathematical Association of America, for his paper ‘‘Flow Networks and Combinatorial Operations Research’’, 1967; Southern Illinois University Award for Outstanding Professional Achievement, 1972; Visiting Professor: U.C. Berkeley, Stanford University, University of Waterloo. Intl. Trans. in Op. Res. 12 (2005) 367–372 INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH

[1]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[2]  Howard Raiffa Decision Analysis: A Personal Account of How It Got Started and Evolved , 2002, Oper. Res..

[3]  H Raiffa,et al.  Decision Analysis: Introductory Lectures on Choices under Uncertainty. , 1969 .

[4]  H. Raiffa,et al.  The art and science of negotiation , 1983 .

[5]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  A. J. Hoffman,et al.  D.R. Fulkerson’s contributions to polyhedral combinatorics , 1978 .

[7]  W. Lucas,et al.  Delbert Ray Fulkerson , 1978 .

[8]  Vasek Chvátal,et al.  D. Ray Fulkerson's Contributions to Operations Research , 1976, Math. Oper. Res..

[9]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[10]  D. R. Fulkerson NETWORKS, FRAMES, BLOCKING SYSTEMS , 1967 .

[11]  D. R. Fulkerson Flow Networks and Combinatorial Operations Research , 1966 .

[12]  H. Raiffa,et al.  The Foundations of Decision under Uncertainty: An Elementary Exposition , 1964 .

[13]  D. R. Fulkerson A Network Flow Computation for Project Cost Curves , 1961 .

[14]  D. R. Fulkerson,et al.  An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[15]  H. Raiffa,et al.  Games and Decisions. , 1960 .

[16]  D. R. Fulkerson Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[17]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.

[18]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[19]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[20]  H. Raiffa 21. Arbitration Schemes for Generalized Two-person Games , 1953 .