A comparison of phase and nonphase network flow algorithms

DOI10.1002/NET.3230190607MaRDI QIDQ3833846zbMATH OpenOpenAlexFDO

Authors Chip Martel

Publication date 1989

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230190607

zbMATH Keywords

Dinic-like algorithmsGT algorithmlayered graphnetwork flowparameterized flow computations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 42283
• Comparison of direct optimization algorithms for dynamic network flow control
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• New algorithms for generalized network flows
• scientific article; zbMATH DE number 4204092
• Network flow algorithms
• Common aspects of several network flow algorithms
• Efficient continuous-time dynamic network flow algorithms
• Algorithms for finding optimal flows in dynamic networks
• On the computational behavior of a polynomial-time network flow algorithm

Cited in

(5)

• Worst case behavior of the Dinic algorithm
• A new Karzanov-type O(n^ 3) max-flow algorithm
• Generalization of a theorem on the parametric maximum flow problem
• A faster parametric minimum-cut algorithm
• Structural and algorithmic properties for parametric minimum cuts

This page was built for publication: A comparison of phase and nonphase network flow algorithms

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