Recent Advances in Network Flows
- 1 July 1968
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 10 (3) , 354-359
- https://doi.org/10.1137/1010060
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A Decomposition Algorithm for Shortest Paths in a NetworkOperations Research, 1968
- Revised Matrix Algorithms for Shortest PathsSIAM Journal on Applied Mathematics, 1967
- On Flows in Pseudosymmetric NetworksSIAM Journal on Applied Mathematics, 1966
- Flow Networks and Combinatorial Operations ResearchThe American Mathematical Monthly, 1966
- Synthesis of a Communication NetworkJournal of the Society for Industrial and Applied Mathematics, 1964
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- An Application of Generalized Linear Programming to Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1962
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958