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

DOI10.1002/1520-6750(199106)38:3%3C413::AID-NAV3220380310%3E3.0.CO;2-JMaRDI QIDQ5202489zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, James B. Orlin

Publication date 1991

Full work available at URL https://doi.org/10.1002/1520-6750(199106)38:3%3C413::aid-nav3220380310%3E3.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) Deterministic network models in operations research (90B10) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A Fast Parametric Maximum Flow Algorithm and Applications
• scientific article; zbMATH DE number 1766747
• A new approach to the maximum-flow problem
• Improved Time Bounds for the Maximum Flow Problem
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• Maximal Flow Through a Network

Cited in

(17)

• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• A Fast Parametric Maximum Flow Algorithm and Applications
• Layered Augmenting Path Algorithms
• Optimal relay node placement in delay constrained wireless sensor network design
• Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
• A computational study of the capacity scaling algorithm for the maximum flow problem
• A double scaling algorithm for the constrained maximum flow problem
• A generalization of the scaling max-flow algorithm
• The maximum flow problem: A max-preflow approach
• Partition-based logical reasoning for first-order and propositional theories
• Computational investigations of maximum flow algorithms
• Preemptive benchmarking problem: An approach for official statistics in small areas
• scientific article; zbMATH DE number 1766747 (Why is no real title available?)
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• AO(nm log(U/n)) time maximum flow algorithm
• An improved algorithm for decomposing arc flows into multipath flows

This page was built for publication: Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202489)