An Application of Generalized Linear Programming to Network Flows

Previous article Next article An Application of Generalized Linear Programming to Network FlowsR. E. Gomory and T. C. HuR. E. Gomory and T. C. Huhttps://doi.org/10.1137/0110020PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] 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[2] L. R. Ford, Jr. and , D. R. Fulkerson, Maximal flow through a network, Canad. J. Math., 8 (1956), 399–404 MR0079251 0073.40203 CrossrefGoogle Scholar[3] 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 MR0093427 0088.12907 CrossrefGoogle Scholar[4] 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[5] G. B. Dantzig and , P. Wolfe, Decomposition principle for linear programs, Operations Res., 8 (1960), 100–110 0093.32806 CrossrefISIGoogle Scholar[6] George B. Dantzig, Linear programming and extensions, Princeton Landmarks in Mathematics, Princeton University Press, Princeton, NJ, 1998xviii+627 MR1658673 0997.90504 Google Scholar[7] O. Wing, Synthesis of optimal communication nets—a linear programming approach, IBM Research Report, RC-293, 1960, July Google Scholar[8] Joseph B. Kruskal, Jr., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7 (1956), 48–50 MR0078686 0070.18404 CrossrefGoogle Scholar[9] R. C. Prim, Shortest connection networks and some generalizations, Bell System Tech. J., 36 (1957), 1389–1401 CrossrefISIGoogle Scholar[10] R. E. Gomory, An algorithm for integer solutions to linear programs, Technical Report, 1, Princeton-IBM Mathematics Research Project, 1958, November 17 Google Scholar[11] D. R. Fulkerson, An out-of-kilter method for minimal cost flow problems, this Journal, 9 (1961), 18–27 0112.12401 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Integer Exact Network Synthesis Problem14 November 2008 | SIAM Journal on Discrete Mathematics, Vol. 23, No. 1AbstractPDF (275 KB)Recent Advances in Network Flows18 July 2006 | SIAM Review, Vol. 10, No. 3AbstractPDF (775 KB)Synthesis of a Communication Network28 July 2006 | Journal of the Society for Industrial and Applied Mathematics, Vol. 12, No. 2AbstractPDF (1705 KB) Volume 10, Issue 2| 1962Journal of the Society for Industrial and Applied Mathematics History Submitted:02 February 1961Published online:13 July 2006 InformationCopyright © 1962 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0110020Article page range:pp. 260-283ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics