Layered Augmenting Path Algorithms

DOI10.1287/MOOR.11.2.362MaRDI QIDQ3734185zbMATH OpenOpenAlexFDO

Authors Éva Tardos, Craig A. Tovey, Michael A. Trick

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.2.362

zbMATH Keywords

Augmenting path algorithmsmaximum polymatroidal network flow algorithmpolymatroid intersection algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• On the maximum capacity augmentation algorithm for the maximum flow problem
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
• Generalized max flows and augmenting paths
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond

Cited in

(11)

• Generalized polymatroids and submodular flows
• An application of submodular flows
• A capacity scaling algorithm for convex cost submodular flows
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• A capacity scaling algorithm for M-convex submodular flow
• A rounding technique for the polymatroid membership problem
• A fast cost scaling algorithm for submodular flow
• Generalized max flows and augmenting paths
• Finding a stable allocation in polymatroid intersection
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Polymatroidal flows with lower bounds

This page was built for publication: Layered Augmenting Path Algorithms

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