Optimal flows in networks with multiple sources and sinks
From MaRDI portal
Publication:4050411
DOI10.1007/BF01585506zbMath0296.90048MaRDI QIDQ4050411
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, Fairness in routing and load balancing, Combining fairness with throughput: Online routing with multiple objectives, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Efficient continuous-time dynamic network flow algorithms, A push-relabel framework for submodular function minimization and applications to parametric optimization, Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability, A good algorithm for lexicographically optimal flows in multi-terminal networks, Engpässe, Staustellen und glatte homogene Ströme in Netzen
Cites Work