Computing Maximal “Polymatroidal” Network Flows
From MaRDI portal
Publication:3964296
DOI10.1287/moor.7.3.334zbMath0498.90029MaRDI QIDQ3964296
Eugene L. Lawler, Charles U. Martel
Publication date: 1982
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.7.3.334
max-flow min-cut theorem; constrained flows; maximal flow algorithm; augmenting path theorem; integral flow theorem; polymatroidal network flow; capacities of sets of arcs
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Related Items
Two algorithms for maximizing a separable concave function over a polymatroid feasible region, New algorithms for the intersection problem of submodular systems, A combinatorial algorithm minimizing submodular functions in strongly polynomial time.