A Note on Convergence of the Ford-Fulkerson Flow Algorithm
From MaRDI portal
Publication:4181630
DOI10.1287/moor.2.2.143zbMath0397.90093OpenAlexW2089180043MaRDI QIDQ4181630
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)
Related Items (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
