Implementing Goldberg's max-flow-algorithm ? A computational investigation
- 1 November 1989
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 33 (6), 383-403
- https://doi.org/10.1007/bf01415937
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A computational comparison of the dinic and network simplex methods for maximum flowAnnals of Operations Research, 1988
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMSJournal of the Operations Research Society of Japan, 1983
- A data structure for dynamic treesPublished by Association for Computing Machinery (ACM) ,1981
- Computational Comparison of Eight Methods for the Maximum Network Flow ProblemACM Transactions on Mathematical Software, 1980
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974