A primal simplex variant for the maximum‐flow problem
- 1 March 1984
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 31 (1) , 41-61
- https://doi.org/10.1002/nav.3800310107
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Pivot Strategies for Primal-Simplex Network CodesJournal of the ACM, 1978
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Algorithms: Algorithm 324: MaxflowCommunications of the ACM, 1968
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956
- Computation of maximal flows in networksNaval Research Logistics Quarterly, 1955