An O (n 2 (m + N log n )log n ) min-cost flow algorithm
From MaRDI portal
Publication:3798456
DOI10.1145/42282.214090zbMath0652.90039MaRDI QIDQ3798456
Publication date: 1988
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/42282.214090
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
90B10: Deterministic network models in operations research
Related Items
Multiindex optimal production planning problems, Three-index linear programs with nested structure, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Multicommodity flows in tree-like networks, The minimal average cost flow problem