Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems

DOI<413::AID-NAV3220380310>3.0.CO;2-J 10.1002/1520-6750(199106)38:3<413::AID-NAV3220380310>3.0.CO;2-JzbMath0724.90021OpenAlexW2136438512MaRDI QIDQ5202489

James B. Orlin, Ravindra K. Ahuja

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199106)38:3<413::aid-nav3220380310>3.0.co;2-j

zbMATH Keywords

shortest augmenting pathparametric maximum flowlayered networksdistance labeldistance-directed algorithmsunit capacity maximum flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A generalization of the scaling max-flow algorithm ⋮ Optimal relay node placement in delay constrained wireless sensor network design ⋮ Preemptive benchmarking problem: An approach for official statistics in small areas ⋮ Partition-based logical reasoning for first-order and propositional theories ⋮ A double scaling algorithm for the constrained maximum flow problem ⋮ A computational study of the capacity scaling algorithm for the maximum flow problem ⋮ AO(nm log(U/n)) time maximum flow algorithm ⋮ Computational investigations of maximum flow algorithms ⋮ An algorithmic study of the maximum flow problem: A comparative statistical analysis ⋮ An improved algorithm for decomposing arc flows into multipath flows ⋮ The maximum flow problem: A max-preflow approach

Cites Work

• Maximal Flow Through a Network
• Unnamed Item