The maximum flow problem: A max-preflow approach
From MaRDI portal
Publication:811325
DOI10.1016/0377-2217(91)90060-9zbMath0734.90031OpenAlexW2066919504MaRDI QIDQ811325
Stefano Pallottino, Maria Grazia Scutellà, Guiseppe Mazzoni
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90060-9
Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
An auction algorithm for the max-flow problem, The maximum flow problem of uncertain network, Efficient preflow push algorithms, Computational investigations of maximum flow algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
- A simple version of Karzanov's blocking flow algorithm
- Scaling algorithms for network problems
- Dual coordinate step methods for linear network flow problems
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- A data structure for dynamic trees
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- An O(n2log n) parallel max-flow algorithm
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
