A Note on Convergence of the Ford-Fulkerson Flow Algorithm

DOI10.1287/MOOR.2.2.143MaRDI QIDQ4181630zbMATH OpenOpenAlexFDO

Authors Alan C. Tucker

Publication date 1977

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

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

zbMATH Keywords

ConvergenceMaximal FlowFord-Fulkerson Flow Algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99)

Cited in

(2)

• Criss-cross methods: A fresh view on pivot algorithms
• Pivot rules for linear programming: A survey on recent theoretical developments

This page was built for publication: A Note on Convergence of the Ford-Fulkerson Flow Algorithm

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