Recent Advances in Network Flows
T. C. Hu · SIAM Review · 1968
Previous article Next article Recent Advances in Network FlowsT. C. HuT. C. Huhttps://doi.org/10.1137/1010060PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] R. G. Busacker and , P. J. Gowen, A procedure for determining a family of minimal-cost network flow patterns, Tech. paper, 15, Operations Research Office, Johns Hopkins University, Baltimore, 1961 Google Scholar[2] Robert G. Busacker and , Thomas L. Saaty, Finite graphs and networks: An introduction with applications, McGraw-Hill Book Co., New York, 1965xiv+294 MR0209176 0146.20104 Google Scholar[3] E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math., 1 (1959), 269–271 10.1007/BF01386390 MR0107609 0092.16002 CrossrefGoogle Scholar[4] R. W. Floyd, Algorithm 97: Shortest path, Comm. ACM, 5 (1962), 345– 10.1145/367766.368168 CrossrefISIGoogle Scholar[5] L. R. Ford, Jr. and , D. R. Fulkerson, Flows in networks, Princeton University Press, Princeton, N.J., 1962xii+194 MR0159700 0106.34802 Google Scholar[6] L. R. Ford, Jr. and , D. R. Fulkerson, A suggested computation for maximal multi-commodity network flows, Management Sci., 5 (1958), 97–101 MR0097878 0995.90516 CrossrefISIGoogle Scholar[7] D. R. Fulkerson, Flow networks and combinatorial operations research, Amer. Math. Monthly, 73 (1966), 115–138 MR0192922 0168.40706 CrossrefISIGoogle Scholar[8] R. E. Gomory and , T. C. Hu, Multi-terminal network flows, J. Soc. Indust. Appl. Math., 9 (1961), 551–570 10.1137/0109047 MR0135624 0112.12405 LinkISIGoogle Scholar[9] R. E. Gomory and , T. C. Hu, An application of generalized linear programming to network flows, J. Soc. Indust. Appl. Math., 10 (1962), 260–283 10.1137/0110020 MR0204155 0105.12805 LinkISIGoogle Scholar[10] R. E. Gomory and , T. C. Hu, Synthesis of a communication network, J. Soc. Indust. Appl. Math., 12 (1964), 348–369 10.1137/0112029 MR0168378 0222.94003 LinkISIGoogle Scholar[11] Ram Prakash Gupta, On flows in pseudosymmetric networks, SIAM J. Appl. Math., 14 (1966), 215–225 10.1137/0114018 MR0205746 0144.45505 LinkISIGoogle Scholar[12] T. C. Hu, Revised matrix algorithms for shortest paths, SIAM J. Appl. Math., 15 (1967), 207–218 10.1137/0115017 MR0214405 0158.15404 LinkISIGoogle Scholar[13] T. C. Hu, A decomposition algorithm for shortest paths in a network, Operations Res., 15 (1968), 91–102 0155.28802 CrossrefISIGoogle Scholar[14] T. C. Hu, Multicommodity network flows, Operations Res., 11 (1963), 340–360 CrossrefISIGoogle Scholar[15] T. C. Hu, Integer Programming and Network Flows, Addison-Wesley, Reading, Massachusetts, 1967, Preliminary ed. Google Scholar[16] W. S. Jewell, Optimum flow through networks, Interim Tech. Rep., 8, Massachusetts Institute of Technology, Revised version: A primal-dual multicommodity flow algorithm, ORC 66-74, University of California, Berkeley, 1966 Google Scholar[17] M. Klein, A primal method for minimum cost flows with application to the assignment and transportation problems, Tech. Rep., 32, Operations Research Group, Columbia University, New York, 1966 Google Scholar[18] A. H. Land and , S. Stairs, The extension of the cascade algorithms to larger graphs, LSE-TNT-20, London School of Economics, 1965 Google Scholar[19] C. V. Martin, An algorithm for shortest paths, Rep., 31, Civil Engineering Department, Massachusetts Institute of Technology, Cambridge, 1963 Google Scholar[20] G. J. Minty, Monotone networks, Proc. Roy. Soc. London. Ser. A, 257 (1960), 194–212 MR0120163 0093.42106 CrossrefISIGoogle Scholar[21] J. D. Murchland, A new method for finding all elementary paths in a complete directed graph, Rep., LSE-TNT-22, London School of Economics, 1965 Google Scholar[22] B. Rothschild and , A. Whinston, Feasiblity of two commodity network flows, Operations Res., 14 (1966), 1121–1129 MR0209001 0173.21703 CrossrefISIGoogle Scholar[23] M. Sakarovitch, The multi-commodity maximum flow problem, ORC 66-25, University of California, Berkeley, 1966 Google Scholar[24] R. Saigal, Multi-commodity flows, ORC Rep., University of California, Berkeley, to appear Google Scholar[25] Alfonso Shimbel, Applications of matrix algebra to communication nets, Bull. Math. Biophys., 13 (1951), 165–178 MR0044104 CrossrefGoogle Scholar[26] J. A. Tomlin, Minimum-cost multi-commodity network flows, Operations Res., 14 (1966), 45–51 CrossrefISIGoogle Scholar[27] Stephen Warshall, A theorem on boolean matrices, J. Assoc. Comput. Mach., 9 (1962), 11–12 MR0149688 0118.33104 CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Mathematical ProgrammingUse of Mathematical Literature | 1 Jan 1977 Cross Ref Maximum circulation and minimum cutset in planar oriented graphsCybernetics, Vol. 11, No. 6 | 1 Jan 1976 Cross Ref Production-allocation scheduling and capacity expansion using network flows under uncertaintyNaval Research Logistics Quarterly, Vol. 20, No. 3 | 1 Sep 1973 Cross Ref On Finding the Paths Through a NetworkBell System Technical Journal, Vol. 51, No. 2 | 29 July 2013 Cross Ref Volume 10, Issue 3| 1968SIAM Review291-405 History Submitted:24 July 1967Accepted:17 March 1968Published online:18 July 2006 InformationCopyright © 1968 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1010060Article page range:pp. 354-359ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics