Flows in networks

Flows in Networks

Volumn , Issue , 2015, Pages 1-194

  Ford, L R ^a   Fulkerson, D R ^b  

^a C E I R Inc   (United States)

^b RAND CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPERATIONS RESEARCH;

COMMUNICATIONS ENGINEERING; COMPUTATIONALLY EFFICIENT; FLOWS IN NETWORKS;

INDUSTRIAL RESEARCH;

EID: 84957946170     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (126)

1. G. B. Dantzig, "Application of the Simplex Method to a Transportation Problem, Activity Analysis of Production and Allocation, Cowles Commission Monograph 13, Wiley, 1951, 359-373.
2. G. B. Dantzig, and D. R. Fulkerson, "On the Max-Flow Min-Cut Theorem of Networks, Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 215-221.
3. P. Elias, A. Feinstem, and C. E. Shannon, "Note on Maximum Flow Through a Network, I.R.E. Trans, on Inform. Theory, IT-2 (1956), 117-119.
4. L. R. Ford, Jr., and D. R. Fulkerson, "Maximal Flow Through A Network, Canad. J. Math. 8 (1956), 399-404.
5. L. R. Ford, Jr., and D. R. Fulkerson, "A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem, Canad. J. Math. 9 (1957), 210-218.
6. L. R. Ford, Jr., and D. R. Fulkerson, "A Suggested Computation for Maximal Multi-Commodity Network Flows, Management Sei. 5 (1958), 97-101.
7. D. R. Fulkerson and G. B. Dantzig, "Computation of Maximal Flows in Networks, Naval Res. Logist. Quart. 2 (1955), 277-283.
8. D. Gale, "The Basic Theorems of Real Linear Equations, Inequalities, Linear Programming, and Game Theory, Naval Res. Logist. Quart. 3 (1956), 193-200.
9. D. Gale, H. W. Kuhn, and A. W. Tucker, "Linear Programming and the Theory of Games, Activity Analysis of Production and Allocation, Cowles Commission Monograph 13, Wiley, 1951, 317-328.
10. A. J. Goldman and A. W. Tucker, "Theory of Linear Programming, Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 53-97.
11. T. E. Harris and F. S. Ross, "Fundamentals of a Method for Evaluating Rail Net Capacities, (U) The RAND Corporation, Research Memorandum RM-1573, October 24, 1956 (Secret).
12. A. J. Hoffman and J. B. Kruskal, Jr., "Integral Boundary Points of Convex Polyhedra, Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 223-246.
13. D. König, Theorie der Endlichen und Unendlichen Graphen, Chelsea Publishing Co., New York, 1936.
14. J. T. Robacker, "On Network Theory, The RAND Corporation, Research Memorandum RM-1498, May 26, 1955.
15. J. T. Robacker, "Min-Max Theorems on Shortest Chains and Disjunct Cuts of a Network, The RAND Corporation, Research Memorandum RM-1660, January 12, 1956.
16. L. S. Shapley, "On Network Flow Functions, The RAND Corporation, Research Memorandum RM-2338, March 16, 1959.
17. G. B. Dantzig and D. R. Fulkerson, "Minimizing the Number of Tankers To Meet a Fixed Schedule, Naval Res. Logist. Quart. 1 (1954), 217-222.
18. G. B. Dantzig and A. J. Hoffman, "Dilworth's Theorem on Partially Ordered Sets," Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 207-214.
19. R. P. Dilworth, "A Decomposition Theorem for Partially Ordered Sets, Ann. of Math. 51 (1950), 161-166.
20. A. L. Dulmage and N. S. Mendelsohn, "The Term and Stochastic Ranks of a Matrix, Canad. J. Math. 11 (1959), 269-279.
21. J. Egerváry, "Matrixok kombinatorikus tulajonsagáiról, Mat. és Fiz. Lapok 38 (1931), 16-28. Translation by H. W. Kuhn, " On Combinatorial Properties of Matrices," George Washington University Logistics Papers 11 (1955).
22. L. R. Ford, Jr., and D. R. Fulkerson, "Network Flow and Systems of Representatives, Canad. J. Math. 10 (1958), 78-85.
23. D. R. Fulkerson, "Note on Dilworth's Decomposition Theorem for Partially Ordered Sets," Proc. Amer. Math. Soc. 7 (1956), 701-702.
24. D. R. Fulkerson, "A Network Flow Feasibility Theorem and Combinatorial Applications, Canad. J. Math. 11 (1959), 440-451.
25. D. R. Fulkerson, "Zero-one Matrices with Zero Trace, Pacific J. Math. 10 (1960), 831-836.
26. D. R. Fulkerson and H. J. Ryser, "Widths and Heights of (0, 1)-Matrices, Canad. J. Math. 13 (1961), 239-255.
27. D. Gale, "A Theorem on Flows in Networks, Pacific J. Math. 7 (1957), 1073-1082.
28. O. Gross, "The Bottleneck Assignment Problem, The RAND Corporation, Paper P-1630, March 6, 1959, presented at the RAND Symposium on Mathematical Programming (Linear Programming and Extensions), March 16-20, 1959.
29. R. M. Haber, "Term Rank of 0, 1 Matrices, Rend. Sem. Mat. Univ. Padova 30 (1960), 24-51.
30. M. Hall, Jr., "An Existence Theorem for Latin Squares, Bull. Amer. Math. Soc. 51 (1945), 387-388.
31. M. Hall, Jr., "Distinct Representatives of Subsets, Bull. Amer. Math. Soc. 54 (1948), 922-926.
32. P. Hall, "On Representatives of Subsets, J. Loud. Math. Soc. 10 (1935), 26-30.
33. A. J. Hoffman, "Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinatorial Analysis, Proc. Symposia on Applied Math. 10 (1960).
34. A. J. Hoffman, and H. W. Kuhn, "On Systems of Distinct Representatives, Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 199-206.
35. A. J. Hoffman, "Systems of Distinct Representatives and Linear Programming, Amer. Math. Monthly 63 (1956), 455-460.
36. S. Johnson, "Optimal Two- and Three-stage Production Schedules with Setup Times Included, Naval Res. Logist. Quart. 1 (1954), 61-68.
37. D. König, Theorie der Endlichen und Unendlichen Graphen, Chelse Publishing Co., New York, 1950, 258 pp.
38. H. W. Kuhn, "The Hungarian Method for the Assignment Problem, Naval Res. Logist. Quart. 2 (1955), 83-97.
39. H. B. Mann and H. J. Ryser, "Systems of Distinct Representatives, Amer. Math. Monthly 60 (1953), 397-401.
40. N. S. Mendelsohn and A. L. Dulmage, "Some Generalizations of the Problem of Distinct Representatives, Canad. J. Math. 10 (1958), 230-241.
41. O. Ore, "Studies on Directed Graphs I, Ann. of Math. 63 (1956), 383-406.
42. O. Ore, "Graphs and Subgraphs, Trans. Amer. Math. Soc. 84 (1957), 109-137.
43. R. Rado, "Factorization of Even Graphs, Quart. J. Math. 20 (1949), 95-104.
44. J. T. Robacker, "On Network Theory, The RAND Corporation, Research Memorandum RM-1498, May 26, 1955.
45. H. J. Ryser, "A Combinatorial Theorem with an Application to Latin Rectangles, Proc. Amer. Math. Soc. 2 (1951), 550-552.
46. H. J. Ryser, "Combinatorial Properties of Matrices of Zeros and Ones, Canad. J. Math. 9 (1957), 371-377.
47. H. J. Ryser, "The Term Rank of a Matrix, Canad. J. Math. 10 (1958), 57-65.
48. H. J. Ryser, "Traces of Matrices of Zeros and Ones, Canad. J. Math. 12 (1960), 463-476.
49. H. J. Ryser, "Matrices of Zeros and Ones, Bull. Amer. Math. Soc. 66 (1960), 442-464.
50. W. T. Tutte, "The Factors of Graphs, Canad. J. Math. 4 (1952), 314-329.
51. R. Bellman, "On a Routing Problem, Quart. Appl. Math. 16 (1958), 87-90.
52. C. Berge, Theorie des Graphes et ses Applications, Dunod, Paris, 1958.
53. R. G. Busaeker and P. J. Gowen, "A Procedure for Determining a Family of Minimal-Cost Network Flow Patterns, O.R.O. Technical Paper 15, 1961.
54. A. S. Cahn, "The Warehouse Problem, Bull. Amer. Math. Soc. 54 (1948), 1073 (abstract).
55. T. F. Cartaino and S. E. Dreyfus, "Application of Dynamic Programming to the Airplane Minimum Time-to-climb Problem, Aero. Engr. Rev. 16 (1957), 74-77.
56. A. Charnes and W. W. Cooper, "Generalizations of the Warehousing Model, Op. Res. Quart. 6 (1955), 131-172.
57. G. B. Dantzig, "Application of the Simplex Method to a Transportation Problem, Activity Analysis of Production and Allocation, Cowles Commission Monograph 13, Wiley, 1951, 359-373.
58. G. B. Dantzig, "Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming, Econometrica 23 (1955), 174-183.
59. G. B. Dantzig, "Discrete Variable Extremum Problems, Op. Res. 5 (1957), 266-277.
60. G. B. Dantzig, "On the Status of Multi-stage Linear Programming Problems, I.S.I. BuU. 36, 303-320.
61. G. B. Dantzig, L. R. Ford, Jr., and D. R. Fulkerson, "A Primal-dual Algorithm", Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 171-181.
62. G. B. Dantzig, D. R. Fulkerson, and S. Johnson, "Solution of a Large Scale Traveling Salesman Problem, Op. Res. 2 (1954), 393-410.
63. J. B. Dennis, Mathematical Programming and Electrical Networks, Wiley, New York, 1959.
64. S. E. Dreyfus, "An Analytic Solution of the Warehouse Problem, Management Sci. 4 (1957), 99-104.
65. A. L. Dulmage and I. Halperin, "On a Theorem of Frobenius-Konig and J. von Neumann's Game of Hide and Seek," Trans. Royal Soc. Canada 49 (1955), 23-29.
66. P. S. Dwyer, "The Solution of the Hitchcock Transportation Problem with a Method of Reduced Matrices, University of Michigan, 1955.
67. J. Egervary, "Matrixok Kombinatorikus Tulajdonsagairol, Mat. es Fiz. Lapok 38 (1931), 16-28. Translation by H. W. Kuhn, "On Combinatorial Properties of Matrices," George Washington University Logistic Papers 11 (1955).
68. M. M. Flood, "On the Hitchcock Distribution Problem, Pacific J. Math. 3 (1953), 369-386.
69. M. M. Flood, "A Computational Algorithm for the Hitchcock Distribution Problem, University of Michigan (1959).
70. L. R. Ford, Jr., "Network Flow Theory, The RAND Corporation, Paper P-923, July 14, 1956.
71. L. R. Ford, Jr.and D. R. Fulkerson, "A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem, Canad. J. Math. 9 (1957), 210-218.
72. L. R. Ford, Jr., "Solving the Transportation Problem, Management Sci. 3 (1956), 24-32.
73. L. R. Ford, Jr., "A Primal-dual Algorithm for the Capacitated Hitchcock Problem, Naval Res. Logist. Quart. 4 (1957), 47-54.
74. L. R. Ford, Jr., "Constructing Maximal Dynamic Flows from Static Flows, Op. Res. 6 (1958), 419-33.
75. T. Fujisawa, "A Computational Method for the Transportation Problem on a Network, J. Op. Res. Soc. Japan 1 (1959), 157-173.
76. D. R. Fulkerson, "The Hitchcock Transportation Problem, The RAND Corporation, Paper P-890, July 9, 1956.
77. L. R. Ford, Jr., "Increasing the Capacity of a Network: the Parametric Budget Problem, Management Sci. 5 (1959), 472-483.
78. L. R. Ford, Jr., "An Out-of-Kilter Method for Minimal Cost Flow Problems, J.Soc. Indust. Appl. Math. 9 (1961), 18-27.
79. D. R. Fulkerson, "A Network Flow Computation for Project Cost Curves, Management Sei. 7 (1961), 167-178.
80. D. R. Fulkerson, "On the Equivalence of the Capacity-constrained Transshipment Problem and the Hitchcock Problem, The RAND Corporation, Research Memorandum RM-2480, January 13, 1960.
81. J. W. Gaddum, A. J. Hoffman, and D. Sokolowsky, "On the Solution of the Caterer Problem, Naval Res. Logist. Quart. 1 (1954), 222-229.
82. D. Gale, "Transient Flows in Networks, Michigan Math. J. 6 (1959), 59-63.
83. D. R. Fulkerson, The Theory of Linear Economic Models, McGraw-Hill, 1960.
84. T. Gallai, "Maximum-minimum Sätze über Graphen, Acta Math. Hung. 9 (1958), 395-434.
85. T. Gallai, "Über Reguläre Kettengruppen, Acta Math. Hung. 10 (1959), 227-240.
86. B. A. Galler and P. S. Dwyer, "Translating the Method of Reduced Matrices to Machines, Naval Res. Logist. Quart. 4 (1957), 55-71.
87. A. N. Gleyzal, "An Algorithm for Solving the Transportation Problem, Research Paper 2583, Nat. Bur. Standards J. 54 (1955), 213-216.
88. I. Heller, "On Linear Systems with Integral Valued Solutions, George Washington University Logistics Seminar, 1956.
89. I. Heller, "Constraint Matrices of Transportation-type Problems, Naval Res. Logist. Quart. 4 (1957), 73-78.
90. I. Heller, "On the Traveling Salesman's Problem," Proceedings Second Symposium in Linear Programming 2 (1955), 643-665.
91. I. Heller, and C. B. Tompkins, "An Extension of a Theorem of Dantzig, Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 247-254.
92. F. L. Hitchcock, "The Distribution of a Product from Several Sources to Numerous Localities, J. Math. Phys. 20 (1941), 224-230.
93. A. J. Hoffman and J. B. Kruskal, Jr., "Integral Boundary Points of Convex Polyhedra, Linear Inequalities and Related Systems, Annals of Mathematics Study 38, Princeton University Press, 1956, 223-246.
94. M. Iri, "Algebraic and Topological Theory of Problems of Transportation Networks with the Help of Electric Circuit Models, R.A.A.O. Research Note 13, 1959.
95. M. Iri, "A New Method of Solving Transportation-Network Problems, J. Op. Res. Soc. Japan. 3 (1960), 27-87.
96. W. Jacobs, "The Caterer Problem, Naval Res. Logist. Quart. 1 (1954), 154-165.
97. W. S. Jewell, "Warehousing and Distribution of a Seasonal Product, Naval Res. Logist. Quart. 4 (1957), 29-34.
98. W. S. Jewell, "Optimal Flow Through Networks, Interim Technical Report No. 8, Massachusetts Institute of Technology, 1958.
99. W. S. Jewell, "Optimal Flow Through Networks with Gains, presented at Second International Conference on Operations Research, Aix-en-Provence, France, 1960.
100. L. Kantorovitch, "On the Translocation of Masses, Compt. Rend. (Doklady) Acad. Sei. 37 (1942), 199-201.
101. L. Kantorovitch, and M. K. Gavurin, "The Application of Mathematical Methods in Problems of Freight Flow Analysis, Collection of Problems
102. J. E. Kelley, Jr., "Critical Path Planning and Scheduling: Mathematical Basis, Op. Res. 9 (1961), 296-320.
103. J. E. Kelley, Jr., and M. R. Walker, "Critical Path Planning and Scheduling, Proc. of Eastern Joint Computer Conference, Boston, 1959.
104. T. C. Koopmans and S. Reiter, "A Model of Transportation, Activity Analysis of Production and Allocation, Cowles Commission Monograph 13, Wiley, 1951, 222-259.
105. D. König, Theorie der Endlichen und Unendlichen Graphen, Chelsea Publishing Co., New York, 1950.
106. H. W. Kuhn, "The Hungarian Method for the Assignment Problem, Naval Res. Logist. Quart. 2 (1955), 83-97.
107. H. W. Kuhn, "Variants of the Hungarian Method for Assignment Problems, Naval Res. Logist. Quart. 3 (1956), 253-258.
108. G. J. Minty, "A Comment on the Shortest Route Problem, Op. Res. 5 (1957), 724.
109. G. J. Minty, "Monotone Networks, Proc. Roy. Soc. London, Ser. A, 257 (1960), 194-212.
110. T. S. Motzkin, "The Assignment Problem, Proceedings Sixth Symposium in Applied Mathematics, McGraw-Hill, 1956, 109-125.
111. J. Munkres, "Algorithms for the Assignment and Transportation Problems, J. Soc. Indust. Appl. Math. 5 (1957), 32-38.
112. A. Orden, "The Transshipment Problem, Management Sei. 3 (1956), 276-285.
113. W. Prager, "On the Caterer Problem, Management Sei. 3 (1956), 15-23.
114. W. Prager, "On Warehousing Problems, Op. Res. 5 (1957), 504-512.
115. L. W. Smith, Jr., "Current Status of the Industrial Use of Linear Programming, Management Sei. 2 (1956), 156-158.
116. A. N. Tolstoi, "Methods of Removing Irrational Shipments in Planning, Sotsialisticheskii Transport 9 (1939), 28-51.
117. A. W. Tucker, "Analogues of Kirchhoff's Laws," George Washington University Logistic Paper 3 (1950).
118. J. von Neumann, "A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem, Contributions to the Theory of Games, Annals of Mathematics Study 28, Princeton University Press, 1953, 5-12.
119. D. F. Votaw, Jr., and A. Orden, "The Personnel Assignment Problem, Project SCOOP, Manual 10, 1952, 155-163.
120. H. M. Wagner, "On a Class of Capacitated Transportation Problems, Management Sei. 5 (1959), 304-318.
121. R. T. Chien, "Synthesis of a Communication Net, I.B.M. J. 4 (1960), 311-320.
122. R. E. Gomory and T. C. Hu, "Multi-terminal Network Flows, I.B.M. Research Report, 1960; to appear in J. Soc. Indust. Appl. Math.
123. R. E. Gomory and T. C. Hu, "An Application of Generalized Linear Programming to Network Flows, I.B.M. Research Report, 1960.
124. J. B. Kruskal, Jr., "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Amer. Math. Soc. 7 (1956), 48-50.
125. W. Mayeda, "Terminal and Branch Capacity Matrices of a Communication Net, I.R.E. Trans, on Circuit Theory 7 (1960), 251-269.
126. R. C. Prim, "Shortest Connection Networks and Some Generalizations, Bell System Tech. J. 36 (1957), 1389-1401.