A comparison of phase and nonphase network flow algorithms
From MaRDI portal
Publication:3833846
DOI10.1002/net.3230190607zbMath0677.90026OpenAlexW2123027496MaRDI QIDQ3833846
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190607
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) Combinatorial optimization (90C27)
Related Items
A new Karzanov-type \(O(n^ 3)\) max-flow algorithm, Generalization of a theorem on the parametric maximum flow problem, Structural and algorithmic properties for parametric minimum cuts, A faster parametric minimum-cut algorithm
Cites Work