Computational investigations of maximum flow algorithms
- 16 March 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 97 (3) , 509-542
- https://doi.org/10.1016/s0377-2217(96)00269-x
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- On strongly polynomial variants of the network simplex algorithm for the maximum flow problemOperations Research Letters, 1991
- The maximum flow problem: A max-preflow approachEuropean Journal of Operational Research, 1991
- Generating pseudo-random permutations and maximum flow algorithmsInformation Processing Letters, 1990
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- A primal simplex variant for the maximum‐flow problemNaval Research Logistics Quarterly, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Computational Comparison of Eight Methods for the Maximum Network Flow ProblemACM Transactions on Mathematical Software, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956