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-JzbMATH Open0724.90021OpenAlexW2136438512MaRDI QIDQ5202489FDOQ5202489

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

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

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)

Cites Work

• Maximal Flow Through a Network
• Title not available (Why is that?)

Cited In (17)

• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• A Fast Parametric Maximum Flow Algorithm and Applications
• Layered Augmenting Path Algorithms
• Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
• Optimal relay node placement in delay constrained wireless sensor network design
• 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
• Partition-based logical reasoning for first-order and propositional theories
• The maximum flow problem: A max-preflow approach
• Computational investigations of maximum flow algorithms
• Preemptive benchmarking problem: An approach for official statistics in small areas
• Title not available (Why is that?)
• 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
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

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)