Network flows

Handbooks in Operations Research and Management Science

Volumn 1, Issue C, 1989, Pages 211-369

  Ahuja, Ravindra K ^a   Magnanti, Thomas L ^a   Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957084120     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(89)01005-4     Document Type: Review

References (255)

1. Ashtiani, H.A., Magnanti, T.L., Implementing primal-dual network flow algorithms. Technical Report OR 055-76, 1976, Operations Research Center, M.I.T., CA.
2. Aho, A.V., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms. 1974, Addison-Wesley, Cambridge, MA.
3. Ahuja, R.K., Batra, J.L., Gupta, S.K., A parametic algorithm for the convex cost network flow and related problems. European J. of Oper. Res. 16 (1984), 222–235.
4. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E., Finding minimum-cost flows by double scaling. Working Paper No. 2047-88, 1988, Sloan School of Management, M.I.T., Reading, MA.
5. Ahuja, R.K., M. Kodialam, and J.B. Orlin (1988), Personal Communications.
6. Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E., Faster algorithms for the shortest path problem. Technical Report No. 193, 1988, Operations Research Center, M.I.T., Cambridge, MA.
7. to appear in Oper. Res.Ahuja, R.K., Orlin, J.B., A fast and simple algorithm for the maximum flow problem. Working Paper 1905-87, 1987, Sloan School of Management, M.I.T., Cambridge, MA.
8. Ahuja, R.K., Orlin, J.B., Improved primal simplex algorithms for the shortest path, assignment and minimum cost flow problems. Working Paper 2090-88, 1988, Sloan School of Management, M.I.T., Cambridge, MA.
9. Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E., Improved algorithms for bipartite network flow problems. 1988. to appear.
10. Ahuja, R.K., Orlin, J.B., Tarjan, R.E., Improved time bounds for the maximum flow problem. Working Paper 1966-87, 1988, Sloan School of Management, M.I.T., Cambridge, MA.
11. Akgül, M., Shortest path and simplex method. Research Report, 1985, Department of Computer Science and Operations Research, North Carolina State University, Cambridge, MA.
12. Akgül, M., A genuinely polynomial primal simplex algorithm for the assignment problem. Research Report, 1985, Department of Computer Science and Operations Research, North Carolina State University, Raleigh, NC.
13. Ali, I., Barnett, D., Farhangian, K., Kennington, J., Patty, B., Shetty, B., McCarl, B., Wong, P., Multicommodity network problems: Applications and computations. A.I.I.E. Trans. 16 (1984), 127–134.
14. Ali, A.I., Helgason, R.V., Kennington, J.L., The convex cost network flow problem: A state-of-the-art survey. Technical Report OREM 78001, 1978, Southern Methodist University, Raleigh, NC.
15. Armstrong, R.D., Klingman, D., Whitman, D., Implementation and analysis of a variant of the dual method for the capacitated transshipment problem. European J. Oper. Res. 4 (1980), 403–420.
16. Assad, A., Multicommodity network flows-A survey. Networks 8 (1978), 37–91.
17. Balinski, M.L., Signature methods for the assignment problem. Oper. Res. 33 (1985), 527–536.
18. Balinski, M.L., Gomory, R.E., A primal method for the assignment and transportation problems. Man. Sci. 10 (1964), 578–593.
19. Barahona, F., Tardos, E., Note on Weintraub's minimum cost flow algorith. Research Report, 1987, Dept. of Mathematics, M.I.T., Dallas, TX.
20. 3) running time. Technical Report TM-83, 1977, Laboratory for Computer Science, MIT, Cambridge, MA.
21. Barr, R., Glover, F., Klingman, D., The alternating path basis algorithm for the assignment problem. Math. Prog. 12 (1977), 1–13.
22. Barr, R., Glover, F., Klingman, D., A network augmenting path basis algorithm for transshipment problems. Proceedings of the International Symposium on Extremal Methods and System Analysis, 1977.
23. Barr, R., Glover, F., Klingman, D., Generalized alternating path algorithm for transportation problems. European J. Oper. Res. 2 (1978), 137–144.
24. Barr, R., Glover, F., Klingman, D., Enhancement of spanning tree labeling procedures for network optimization. INFOR 17 (1979), 16–34.
25. Bazaraa, M., Jarvis, J.J., Linear Programming and Network Flows. 1978, John Wiley & Sons, Cambridge, MA.
26. Bellman, R., On a routing problem. Quart. Appl. Math. 16 (1958), 87–90.
27. Berge, C., Ghouila-Houri, A., Programming, Games and Transportation Networks. 1962, John Wiley & Sons, New York.
28. also in Ann. of Oper. Res.14, 105–123 Bertsekas, D.P., A distributed algorithm for the assignment problem. Working Paper, 1979, Laboratory for Information and Decision Systems, M.I.T., New York.
29. Bertsekas, D.P., A new algorithm for the assignment problem. Math. Prog. 21 (1981), 152–171.
30. Bertsekas, D.P., A unified framework for primal-dual methods in minimum cost network flow problems. Math. Prog. 32 (1985), 125–145.
31. Bertsekas, D.P., Distributed relaxation methods for linear network flow problems. Proc. of 25th IEEE Conference on Decision and Control, Athens, Greece, 1986.
32. also in Ann. of Oper. Res.14, 105–123 Bertsekas, D.P., The auction algorithm: A distributed relaxation method for the assignment problem. Report LIDS-P-1653, 1987, Laboratory for Information Decision systems, M.I.T., Cambridge, MA.
33. to appear in Math. Prog. Ser. B.Bertsekas, D.P., Eckstein, J., Dual coordinate step methods for linear network flow problems. 1988.
34. Bertsekas, D., Gallager, R., Data Networks. 1987, Prentice-Hall, Cambridge, MA.
35. Bertsekas, D.P., Hosein, P.A., Tseng, P., Relaxation methods for network flow problems with convex arc costs. SIAM J. Control and Optimization 25 (1987), 1219–1243.
36. Bertsekas, D.P., Tseng, P., The relax codes for linear minimum cost network flow problems. Simeone, B., et al. (eds.) FORTRAN Codes for Network Optimization As Annals of Operations Research, 13, 1988, 125–190.
37. Bertsekas, D.P., Tseng, P., Relaxation methods for minimum cost ordinary and generalized network flow problems. Oper. Res. 36 (1988), 93–114.
38. Bland, R.G., Jensen, D.L., On the computational behavior of a polynomial-time network flow algorithm. Technical Report 661, 1985, School of Operations Research and Industrial Engineering, Cornell University, Englewood Cliffs, NJ.
39. Bodin, L.D., Golden, B.L., Assad, A.A., Ball, M.O., Routing and scheduling of vehicles and crews. Comput. and Oper. Res. 10 (1983), 65–211.
40. Boyd, A., and J.B. Orlin (1986), Personal Communication.
41. Bradley, G., Brown, G., Graves, G., Design and implementation of large scale primal transshipment algorithms. Man. Sci. 21 (1977), 1–38.
42. Bradley, S.P., Hax, A.C., Magnanti, T.L., Applied Mathematical Programming. 1977, Addison-Wesley, Ithaca, N.Y.
43. Busaker, R.G., Gowen, P.J., A procedure for determining a family of minimal-cost network flow patterns. O.R.O. Technical Report No. 15, 1961, Operational Research Office, Johns Hopkins University, New York.
44. Carpento, G., Martello, S., Toth, P., Algorithms and codes for the assignment problem. Simeone, B., et al. (eds.) FORTRAN Codes for Network Optimization As Annals of Operations Research, 13, 1988, 193–224.
45. Carraresi, P., Sodini, C., An efficient algorithm for the bipartite matching problem. European J. Oper. Res. 23 (1986), 86–93.
46. Cheriyan, J., Parametrized worst case networks for preflow push algorithms. Technical Report, 1988, Computer Science Group, Tata Institute of Fundamental Research, Baltimore, MD.
47. Cheriyan, J., Maheshwari, S.N., Analysis of preflow push algorithm for maximum network flow. Technical Report, 1987, Dept. of Computer Science and Engineering, Indian Institute of Technology, Bombay, India.
48. 2√E) operation. Mathematical Methods of Solution of Economical Problems 7 (1977), 112–125.
49. Cheung, T., Computational comparison of eight methods for the maximum network flow problem. ACM Trans. Math. Software 6 (1980), 1–16.
50. Christophides, N., Graph Theory: An Algorithmic Approach. 1975, Academic Press, New Delhi, India.
51. Cunningham, W.H., A network simplex method. Math. Prog. 11 (1976), 105–116.
52. Cunningham, W.H., Theoretical properties of the network simplex method. Math. of Oper. Res. 4 (1979), 196–208.
53. Dantzig, G.B., Application of the simplex method to a transportation problem. Koopmans, T.C., (eds.) Activity Analysis of Production and Allocation, 1951, John Wiley & Sons, New York, 359–373.
54. Dantzig, G.B., Upper bounds, secondary constraints, and block triangularity in linear programming. Econometrica 23 (1955), 174–183.
55. Dantzig, G.B., On the shortest route through a network. Man. Sci. 6 (1960), 187–190.
56. Dantzig, G.B., Linear Programming and Extensions. 1962, Princeton University Press, New York.
57. Dantzig, G.B., All shortest routes in a graph. Rosenthiel, P., (eds.) Theory of Graphs, 1967, Gordon and Breach, Princeton, NJ, 91–92.
58. Dantzig, G.B., Fulkerson, D.R., On the max-flow min-cut theorem of networks. Kuhn, H.W., Tucker, A.W., (eds.) Linear Inequalities and Related Systems Annals of Mathematics Study, 38, 1956, Princeton University Press, New York, 215–221.
59. Dantzig, G.B., Wolfe, P., Decomposition principle for linear programs. Oper. Res. 8 (1960), 101–111.
60. Dembo, R.S., Klincewicz, J.G., A scaled reduced gradient algorithm for network flow problems with convex separable costs. Math. Prog. Study 15 (1981), 125–147.
61. Deo, N., Pang, C., Shortest path algorithms: Taxonomy and annotation. Networks 14 (1984), 275–323.
62. Denardo, E.V., Fox, B.L., Shortest-route methods: 1. Reaching, pruning and buckets. Oper. Res. 27 (1979), 161–186.
63. Derigs, U., The shortest augmenting path method for solving assignment problems: Motivation and computational experience. Ann. of Oper. Res. 4 (1985), 57–102.
64. Derigs, U., Programming in Networks and Graphs. Lecture Notes in Economics and Mathematical Systems, Vol. 300, 1988, Springer-Verlag, Princeton, NJ.
65. Derigs, U., Meier, W., Implementing Goldberg's max-flow algorithm: A computational investigation. Technical Report, 1988, University of Bayreuth, Berlin.
66. Dial, R., Algorithm 360: Shortest path forest with topological ordering. Comm. ACM 12 (1969), 632–633.
67. Dial, R., Glover, F., Karney, D., Klingman, D., A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9 (1979), 215–248.
68. Dijkstra, E., A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271.
69. Dinic, E.A., Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11 (1970), 1277–1280.
70. Dinic, E.A., Kronrod, M.A., An algorithm for solution of the assignment problem. Soviet Math. Doklady 10 (1969), 1324–1326.
71. Unpublished paper Edmonds, J., Exponential growth of the simplex method for the shortest path problem. 1970, University of Waterloo, West Germany.
72. Edmonds, J., Karp, R.M., Theoretical improvements in algorithmic efficiency of network flow problems. J. ACM 19 (1972), 248–264.
73. Elam, J., Glover, F., Klingman, D., A strongly convergent primal simplex algorithm for generalized networks. Math. of Oper. Res. 4 (1979), 39–59.
74. Emde Boas, P. van, Kaas, R., Zijlstra, E., Design and implementation of an efficient priority queue. Math. Systems Theory 10 (1977), 99–127.
75. Elias, P., Feinstein, A., Shannon, C.E., Note on maximum flow through a network. IRE Trans. on Inform. Theory 2 (1956), 117–119.
76. Engquist, M., A successive shortest path algorithm for the assignment problem. INFOR 20 (1982), 370–384.
77. Even, S., The max-flow algorithm of Dinic and Karzanov: An exposition, Technical Report TM-80, 1976, Laboratory for Computer Science, M.I.T., Ontario, Canada.
78. Even, S., Graph Algorithms. 1979, Computer Science Press, Cambridge, MA.
79. Even, S., Tarjan, R.E., Network flow and testing graph connectivity. SIAM J. Comput. 4 (1975), 507–518.
80. to appear in Algorithmica Fernandez-Baca, D., Martel, C.U., On the efficiency of maximum flow algorithms on networks with small integer capacities. Research Report, 1987, Department of Computer Science, Iowa State University, Rockville, MD.
81. Florian, M., Nonlinear cost network models in transportation analysis. Math. Prog. Study 26 (1986), 167–196.
82. Floyd, R.W., Algorithm 97: Shortest path. Comm. ACM, 5, 1962, 345.
83. Goldfarb, D., Reid, J.K., A practicable steepest edge simplex algorithm. Math. Prog. 12 (1977), 361–371.
84. Gomory, R.E., Hu, T.C., Multi-terminal network flows. J. of SIAM 9 (1961), 551–570.
85. Gondran, M., Minoux, M., Graphs and Algorithms. 1984, Wiley-Interscience, Ames, IA.
86. Grigoriadis, M.D., An efficient implementation of the network simplex method. Math. Prog. Study 26 (1986), 83–111.
87. Grigoriadis, M.D. (1988), Personal Communication.
88. Grigoriadis, M.D., Hsu, T., The Rutgers minimum cost network flow subroutines. SIGMAP Bulletin of the ACM 26 (1979), 17–18.
89. Gusfield, D., Very simple algorithms and programs for all pairs network flow analysis. Research Report No. CSE-87-1, 1987, Dept. of Computer Science and Engineering, University of California, New York.
90. Gusfield, D., Martel, C., Fernandez-Baca, D., Fast algorithms for bipartite network flow. Technical Report No. YALEN/DCS/TR-356, 1985, Yale University, Davis, CA.
91. Hamachar, H., Numerical investigations on the maximal flow algorithm of Karzanov. Computing 22 (1979), 17–29.
92. 2n) algorithm for maximum flow in undirected planar networks. SIAM J. Comput. 14 (1985), 612–624.
93. Hausman, D., Integer Programming and Related Areas: A Classified Bibliography. Lecture Notes in Economics and Mathematical Systems, Vol. 160, 1978, Springer-Verlag, New Haven, CT.
94. Helgason, R.V., Kennington, J.L., An efficient procedure for implementing a dual-simplex network flow algorithm. AIIE Trans. 9 (1977), 63–68.
95. Hitchcock, F.L., The distribution of a product from several sources to numerous facilities. J. Math. Phys. 20 (1941), 224–230.
96. Hoffman, A.J., Markowitz, H.M., A note on shortest path, assignment, and transportation problems. Naval Res. Log. Quart. 10 (1963), 375–379.
97. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. of Comput. 2 (1973), 225–231.
98. Hu, T.C., Multicommodity network flows. Oper. Res. 11 (1963), 344–360.
99. Hu, T.C., Integer Programming and Network Flows. 1969, Addison-Wesley, Berlin.
100. Hung, M.S., A polynomial simplex method for the assignment problem. Oper. Res. 31 (1983), 595–600.
101. Hung, M.S., Rom, W.O., Solving the assignment problem by relaxation. Oper. Res. 28 (1980), 969–982.
102. Imai, H., On the practical efficiency of various maximum flow algorithms. J. Oper. Res. Soc. Japan 26 (1983), 61–82.
103. Imai, H., Iri, M., Practical efficiencies of existing shortest-path algorithms and a new bucket algorithm. J. Oper. Res. Soc. Japan 27 (1984), 43–58.
104. Iri, M., A new method of solving transportation-network problems. J. Oper. Res. Soc. Japan 3 (1960), 27–87.
105. Iri, M., Network Flows, Transportation and Scheduling. 1969, Academic Press, New York.
106. Itai, A., Shiloach, Y., Maximum flow in planar networks. SIAM J. Comput. 8 (1979), 135–150.
107. Jensen, P.A., Barnes, W., Network Flow Programming. 1980, John Wiley & Sons, New York.
108. Jewell, W.S., Optimal flow through networks. Interim Technical Report No. 8, 1958, Operations Research Center, M.I.T., New York.
109. Jewell, W.S., Optimal flow through networks with gains. Oper. Res. 10 (1962), 476–499.
110. Johnson, D.B., Efficient algorithms for shortest paths in sparse networks. J. ACM 24 (1977), 1–13.
111. Johnson, D.B., Efficient special purpose priority queues. Proc. 15th Annual Allerton Conference on Comm., Control and Computing, 1977, 1–7.
112. Johnson, D.B., A priority queue in which initialization and queue operations take O(log log D) time. Math. Sys. Theory 15 (1982), 295–309.
113. 3/2 log n) time. Proceedings of the 20th Annual Allerton Conference on Comm. Control, and Computing, 1982, Univ. of Illinois, Cambridge, MA.
114. Johnson, E.L., Networks and basic solutions. Oper. Res. 14 (1966), 619–624.
115. Jonker, R., Volgenant, T., Improving the Hungarian assignment algorithm. Oper. Res. Letters 5 (1986), 171–175.
116. Jonker, R., Volgenant, A., A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38 (1987), 325–340.
117. Translated in Kantorovich, L.V., Mathematical methods in the organization and planning of production, Publication House of the Leningrad University. 1960 Man. Sci. 6 (1939), 366–422.
118. Kapoor, S., Vaidya, P., Fast algorithms for convex quadratic programming and multicommodity flows. Proc. of the 18th ACM Symp. on the Theory of Comp., 1986, 147–159.
119. Karmarkar, N., A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984), 373–395.
120. Karzanov, A.V., Determining the maximal flow in a network by the method of preflows. Soviet Math. Doklady 15 (1974), 434–437.
121. Kastning, C., Integer Programming and Related Areas: A Classified Bibliography. Lecture Notes in Economics and Mathematical Systems, Vol. 128, 1976, Springer-Verlag, Urbana-Champaign, IL.
122. Kelton, W.D., Law, A.M., A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary are lengths. Networks 8 (1978), 97–106.
123. Kennington, J.L., Survey of linear cost multicommodity network flows. Oper. Res. 26 (1978), 209–236.
124. Kennington, J.L., Helgason, R.V., Algorithms for Network Programming. 1980, Wiley-Interscience, Berlin.
125. Kershenbaum, A., A note on finding shortest path trees. Networks 11 (1981), 399–400.
126. Klein, M., A primal method for minimal cost flows. Man. Sci. 14 (1967), 205–220.
127. Klincewicz, J.G., A Newton method for convex separable network flow problems. Networks 13 (1983), 427–442.
128. Klingman, D., Napier, A., Stutz, J., NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Man. Sci. 20 (1974), 814–821.
129. also reprinted as supplement to Koopmans, T.C., Optimum utilization of the transportation system. Proceedings of the International Statistical Conference, Washington, DC, 1947 Econometrica, 17, 1949.
130. Kuhn, H.W., The Hungarian method for the assignment problem. Naval Res. Log. Quart. 2 (1955), 83–97.
131. Lawler, E.L., Combinatorial Optimization: Networks and Matroids. 1976, Holt, Rinehart and Winston, New York.
132. Magnanti, T.L., Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks 11 (1981), 179–214.
133. Magnanti, T.L., Wong, R.T., Network design and transportation planning: Models and algorithms. Trans. Sci. 18 (1984), 1–56.
134. 3) algorithm for finding maximum flows in networks. Inform. Process. Lett. 7 (1978), 277–278.
135. Martel, C.V., A comparison of phase and non-phase network flow algorithms. Research Report, 1978, Dept. of Electrical and Computer Engineering, University of California, New York.
136. McGinnis, L.F., Implementation and testing of a primal-dual algorithm for the assignment problem. Oper. Res. 31 (1983), 277–291.
137. Mehlhorn, K., Data Structures and Algorithms. 1984, Springer-Verlag, Davis, CA.
138. Meyer, R.R., Two segment separable programming. Man. Sci. 25 (1979), 285–295.
139. Meyer, R.R., Kao, C.Y., Secant approximation methods for convex optimization. Math. Prog. Study 14 (1981), 143–162.
140. Minieka, E., Optimization Algorithms for Networks and Graphs. 1978, Marcel Dekker, Berlin.
141. Goldfarb, D., Reid, J.K., A practicable steepest edge simplex algorithm. Math. Prog. 12 (1977), 361–371.
142. Gomory, R.E., Hu, T.C., Multi-terminal network flows. J. of SIAM 9 (1961), 551–570.
143. Gondran, M., Minoux, M., Graphs and Algorithms. 1984, Wiley-Interscience, New York.
144. Grigoriadis, M.D., An efficient implementation of the network simplex method. Math. Prog. Study 26 (1986), 83–111.
145. Grigoriadis, M.D. (1988), Personal Communication.
146. Grigoriadis, M.D., Hsu, T., The Rutgers minimum cost network flow subroutines. SIGMAP Bulletin of the ACM 26 (1979), 17–18.
147. Gusfield, D., Very simple algorithms and programs for all pairs network flow analysis. Research Report No. CSE-87-1, 1987, Dept. of Computer Science and Engineering, University of California, New York.
148. Gusfield, D., Martel, C., Fernandez-Baca, D., Fast algorithms for bipartite network flow. Technical Report No. YALEN/DCS/TR-356, 1985, Yale University, Davis, CA.
149. Hamachar, H., Numerical investigations on the maximal flow algorithm of Karzanov. Computing 22 (1979), 17–29.
150. 2n) algorithm for maximum flow in undirected planar networks. SIAM J. Comput. 14 (1985), 612–624.
151. Hausman, D., Integer Programming and Related Areas: A Classified Bibliography. Lecture Notes in Economics and Mathematical Systems, Vol. 160, 1978, Springer-Verlag, New Haven, CT.
152. Helgason, R.V., Kennington, J.L., An efficient procedure for implementing a dual-simplex network flow algorithm. AIIE Trans. 9 (1977), 63–68.
153. Hitchcock, F.L., The distribution of a product from several sources to numerous facilities. J. Math. Phys. 20 (1941), 224–230.
154. Hoffman, A.J., Markowitz, H.M., A note on shortest path, assignment, and transportation problems. Naval Res. Log. Quart. 10 (1963), 375–379.
155. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. of Comput. 2 (1973), 225–231.
156. Hu, T.C., Multicommodity network flows. Oper. Res. 11 (1963), 344–360.
157. Hu, T.C., Integer Programming and Network Flows. 1969, Addison-Wesley, Berlin.
158. Hung, M.S., A polynomial simplex method for the assignment problem. Oper. Res. 31 (1983), 595–600.
159. Hung, M.S., Rom, W.O., Solving the assignment problem by relaxation. Oper. Res. 28 (1980), 969–982.
160. Imai, H., On the practical efficiency of various maximum flow algorithms. J. Oper. Res. Soc. Japan 26 (1983), 61–82.
161. Imai, H., Iri, M., Practical efficiencies of existing shortest-path algorithms and a new bucket algorithm. J. Oper. Res. Soc. Japan 27 (1984), 43–58.
162. Iri, M., A new method of solving transportation-network problems. J. Oper. Res. Soc. Japan 3 (1960), 27–87.
163. Iri, M., Network Flows, Transportation and Scheduling. 1969, Academic Press, New York.
164. Itai, A., Shiloach, Y., Maximum flow in planar networks. SIAM J. Comput. 8 (1979), 135–150.
165. Jensen, P.A., Barnes, W., Network Flow Programming. 1980, John Wiley & Sons, New York.
166. Jewell, W.S., Optimal flow through networks. Interim Technical Report No. 8, 1958, Operations Research Center, M.I.T., New York.
167. Jewell, W.S., Optimal flow through networks with gains. Oper. Res. 10 (1962), 476–499.
168. Johnson, D.B., Efficient algorithms for shortest paths in sparse networks. J. ACM 24 (1977), 1–13.
169. Johnson, D.B., Efficient special purpose priority queues. Proc. 15th Annual Allerton Conference on Comm., Control and Computing, 1977, 1–7.
170. Johnson, D.B., A priority queue in which initialization and queue operations take O(log log D) time. Math. Sys. Theory 15 (1982), 295–309.
171. 3/2 log n) time. Proceedings of the 20th Annual Allerton Conference on Comm. Control, and Computing, 1982, Univ. of Illinois, Cambridge, MA.
172. Johnson, E.L., Networks and basic solutions. Oper. Res. 14 (1966), 619–624.
173. Jonker, R., Volgenant, T., Improving the Hungarian assignment algorithm. Oper. Res. Letters 5 (1986), 171–175.
174. Jonker, R., Volgenant, A., A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38 (1987), 325–340.
175. pp. Translated in Kantorovich, L.V., Mathematical methods in the organization and planning of production. Man. Sci., 6, 1939, 1960, Publication House of the Leningrad University, Urbana-Champaign, IL, 366–422.
176. Kapoor, S., Vaidya, P., Fast algorithms for convex quadratic programming and multicommodity flows. Proc. of the 18th ACM Symp. on the Theory of Comp., 1986, 147–159.
177. Karmarkar, N., A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984), 373–395.
178. Karzanov, A.V., Determining the maximal flow in a network by the method of preflows. Soviet Math. Doklady 15 (1974), 434–437.
179. Kastning, C., Integer Programming and Related Areas: A Classified Bibliography. Lecture Notes in Economics and Mathematical Systems, Vol. 128, 1976, Springer-Verlag, Berlin.
180. Kelton, W.D., Law, A.M., A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths. Networks 8 (1978), 97–106.
181. Kennington, J.L., Survey of linear cost multicommodity network flows. Oper. Res. 26 (1978), 209–236.
182. Kennington, J.L., Helgason, R.V., Algorithms for Network Programming. 1980, Wiley-Interscience, Berlin.
183. Kershenbaum, A., A note on finding shortest path trees. Networks 11 (1981), 399–400.
184. Klein, M., A primal method for minimal cost flows. Man. Sci. 14 (1967), 205–220.
185. Klincewicz, J.G., A Newton method for convex separable network flow problems. Networks 13 (1983), 427–442.
186. Klingman, D., Napier, A., Stutz, J., NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Man. Sci. 20 (1974), 814–821.
187. also reprinted as supplement to Koopmans, T.C., Optimum utilization of the transportation system. Proceedings of the International Statistical Conference, Washington, DC, 1947 Econometrica, 17, 1949.
188. Kuhn, H.W., The Hungarian method for the assignment problem. Naval Res. Log. Quart. 2 (1955), 83–97.
189. Lawler, E.L., Combinatorial Optimization: Networks and Matroids. 1976, Holt, Rinehart and Winston, New York.
190. Magnanti, T.L., Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks 11 (1981), 179–214.
191. Magnanti, T.L., Wong, R.T., Network design and transportation planning: Models and algorithms. Trans. Sci. 18 (1984), 1–56.
192. 3) algorithm for finding maximum flows in networks. Inform. Process. Lett. 7 (1978), 277–278.
193. Martel, C.V., A comparison of phase and non-phase network flow algorithms, Research. Research Report, 1978, Dept. of Electrical and Computer Engineering, University of California, New York.
194. McGinnis, L.F., Implementation and testing of a primal-dual algorithm for the assignment problem. Oper. Res. 31 (1983), 277–291.
195. Mehlhorn, K., Data Structures and Algorithms. 1984, Springer-Verlag, Davis CA.
196. Meyer, R.R., Two segment separable programming. Man. Sci. 25 (1979), 285–295.
197. Meyer, R.R., Kao, C.Y., Secant approximation methods for convex optimization. Math. Prog. Study 14 (1981), 143–162.
198. Minieka, E., Optimization Algorithms for Networks and Graphs. 1978, Marcel Dekker, Berlin.
199. Minoux, M., A polynomial algorithm for minimum quadratic cost flow problems. European J. Oper. Res. 18 (1984), 377–387.
200. Minoux, M., Network synthesis and optimum network design problems: Models, solution methods and applications. Technical Report, 1985, Laboratoire MASI Universite Pierre et Marie Curie, New York.
201. Minoux, M., Solving integer minimum cost flows with separable convex cost objective polynomially. Math. Proc. Study, 26, 1986, 237–239.
202. Minoux, M., Network synthesis and dynamic network optimization. Ann. Discrete Math. 31 (1987), 283–324.
203. Minty, G.J., Monotone networks. Proc. Roy. Soc. London Ser. A, 257, 1960, 194–212.
204. Moore, E.F., The shortest path through a maze. Proceedings of the International Symposium on the Theory of Switching Part II; The Annals of the Computation Laboratory of Harvard University 30, 1957, Harvard University Press, Paris, France, 285–292.
205. Mulvey, J., Pivot strategies for primal-simplex network codes. J. ACM 25 (1978), 266–270.
206. Mulvey, J., Testing a large-scale network optimization program. Math. Prog. 15 (1978), 291–314.
207. Murty, K.G., Linear and Combinatorial Programming. 1976, John Wiley & Sons, Boston, MA.
208. Nemhauser, G.L., Wolsey, L.A., Integer and Combinatorial Optimization. 1988, John Wiley & Sons, New York.
209. Orden, A., The transshipment problem. Man. Sci. 2 (1956), 276–285.
210. Orlin, J.B., Maximum-throughput dynamic network flows. Math. Prog. 27 (1983), 214–231.
211. Orlin, J.B., Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem. Technical Report No. 1615-84, 1984, Sloan School of Management, M.I.T., New York.
212. Orlin, J.B., On the simplex algorithm for networks and generalized networks. Math. Prog. Study 24 (1985), 166–178.
213. Orlin, J.B., A faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Symp. on the Theory of Comp., 1988, 377–387.
214. Orlin, J.B., Ahuja, R.K., New distance-directed algorithms for maximum flow and parametric maximum flow problems. Working Paper 1908-87, 1987, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
215. Orlin, J.B., Ahuja, R.K., New scaling algorithms for the assignment and minimum cycle mean problems. Working Paper No. OR 178-88, 1988, Operations Research Center, M.I.T., Cambridge, MA.
216. Papadimitriou, C.H., Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity. 1982, Prentice-Hall, Cambridge, MA.
217. Pape, U., Implementation and Efficiency of Moore-algorithms for the shortest route problem. Math. Prog. 7 (1974), 212–222.
218. Pape, U., Algorithm 562: Shortest path lengths. ACM Trans. Math. Software 6 (1980), 450–455.
219. Phillips, D.T., Garcia-Diaz, A., Fundamentals of Network Analysis. 1981, Prentice-Hall, Englewood Cliffs, NJ.
220. Pollack, M., Wiebenson, W., Solutions of the shortest-route problem — A review. Oper. Res. 8 (1960), 224–230.
221. Potts, R.B., Oliver, R.M., Flows in Transportation Networks. 1972, Academic Press, Englewood Cliffs, NJ.
222. Rock, H., Scaling techniques for minimal cost network flows. Page, V., (eds.) Discrete Structures and Algorithms, 1980, Carl Hansen, New York, 101–191.
223. Rockafellar, R.T., Network Flows and Monotropic Optimization. 1984, Wiley-Interscience, Munich.
224. Unpublished Ph.D. Dissertation Roohy-Laleh, E., Improvements to the Theoretical Efficiency of the Network Simplex Method. 1980, Carleton University, New York.
225. Rothfarb, B., Shein, N.P., Frisch, I.T., Common terminal multicommodity flow. Oper. Res. 16 (1968), 202–205.
226. Sheffi, Y., Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. 1985, Prentice-Hall, Ottawa, Canada.
227. 2(I)) maximum flow algorithm. Technical Report STAN-CS-78-702, 1978, Computer Science Dept., Stanford University, Englewood Cliffs, NJ.
228. 2 log n) parallel max-flow algorithm. J. Algorithms 3 (1982), 128–146.
229. Sleator, D.D., Tarjan, R.E., A data structure for dynamic trees. J. Comput. Systems Sci. 24 (1983), 362–391.
230. Smith, D.K., Network Optimisation Practice: A Computational Guide. 1982, John Wiley & Sons, CA.
231. Srinivasan, V., Thompson, G.L., Benefit-cost analysis of coding techniques for primal transportation algorithm. J. ACM 20 (1973), 194–213.
232. Swamy, M.N.S., Thulsiraman, K., Graphs, Networks, and Algorithms. 1981, John Wiley & Sons, New York.
233. Syslo, M.M., Deo, N., Kowalik, J.S., Discrete Optimization Algorithms. 1983, Prentice-Hall, New York.
234. Tabourier, Y., All shortest distances in a graph: An improvement to Dantzig's inductive algorithm. Discrete Math. 4 (1973), 83–87.
235. Tardos, E., A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 (1985), 247–255.
236. Tarjan, R.E., Data Structures and Network Algorithms. 1983, SIAM, Englewood Cliffs, NJ.
237. Tarjan, R.E., A simple version of Karzanov's blocking flow algorithm. Oper. Res. Letters 2 (1984), 265–268.
238. Tarjan, R.E., Algorithms for maximum network flow. Math. Prog. Study 26 (1986), 1–11.
239. Tarjan, R.E. (1987), Personal Communication.
240. Tomizava, N., On some techniques useful for solution of transportation network problems. Networks 1 (1972), 173–194.
241. Truemper, K., On max flow with gains and pure min-cost flows. SIAM J. Appl. Math. 32 (1977), 450–456.
242. 1.5n)L) arithmetic operations. Proc. of the 19th ACM Symp. on the Theory of Comp., 1987, 29–38.
243. Van Vliet, D., Improved shortest path algorithms for transport networks. Transp. Res. 12 (1978), 7–20.
244. Von Randow, R., Integer Programming and Related Areas: A Classified Bibliography 1978–1981. Lecture Notes in Economics and Mathematical Systems, Vol. 197, 1982, Springer-Verlag, Philadelphia, PA.
245. Von Randow, R., Integer Programming and Related Areas: A Classified Bibliography 1981–1984. Lecture Notes in Economics and Mathematical Systems, Vol. 243, 1985, Springer-Verlag, Berlin.
246. Wagner, R.A., A shortest path algorithm for edge-sparse graphs. J. ACM 23 (1976), 50–57.
247. Warshall, S., A theorem on Boolean matrices. J. ACM 9 (1962), 11–12.
248. Weintraub, A., A primal algorithm to solve network flow problems with convex costs. Man. Sci. 21 (1974), 87–97.
249. Weintraub, A., Barahona, F., A dual algorithm for the assignment problem. Departmente de Industrias Report No. 2, 1979, Universidad de Chile-Sede Occidente, Berlin.
250. Whiting, P.D., Hillier, J.A., A method for finding the shortest route through a road network. Oper. Res. Quart. 11 (1960), 37–40.
251. Williams, J.W.J., Algorithm 232: Heapsort. Comm. ACM 7 (1964), 347–348.
252. Zadeh, N., Theoretical efficiency of the Edmonds-Karp algorithm for computing maximal flows. J. ACM 19 (1972), 184–192.
253. Zadeh, N., A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Proc., 5, 1973, 255–266.
254. Zadeh, N., More pathological examples for network flow problems. Math. Prog. 5 (1973), 217–224.
255. Zadeh, N., Near equivalence of network flow algorithms. Technical Report No. 26, 1979, Dept. of Operations Research, Stanford University, Chile.