IFORS' Operational Research Hall of Fame
暂无分享,去创建一个
[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 .