On a capacity scaling algorithm for the constrained maximum flow problem
From MaRDI portal
Publication:5191144
DOI10.1002/net.20263zbMath1176.90064OpenAlexW4246415139MaRDI QIDQ5191144
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/2480
Deterministic network models in operations research (90B10) Theory of organizations, manpower planning in operations research (90B70)
Related Items
A capable neural network model for solving the maximum flow problem, A generalized approximation framework for fractional network flow and packing problems, A network simplex method for the budget-constrained minimum cost flow problem, A specialized network simplex algorithm for the constrained maximum flow problem, A faster polynomial algorithm for the constrained maximum flow problem
Cites Work