Optimal flows in networks with multiple sources and sinks
From MaRDI portal
Publication:4050411
DOI10.1007/BF01585506zbMath0296.90048OpenAlexW2129391890MaRDI QIDQ4050411
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585506
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (53)
Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis ⋮ Linear and combinatorial sharing problems ⋮ PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ A solution to the random assignment problem on the full preference domain ⋮ Maximum Throughput Network Routing Subject to Fair Flow Allocation ⋮ Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines ⋮ A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Equivalence of convex minimization problems over base polytopes ⋮ An approximation to max min fairness in multi commodity networks ⋮ FlowLoc problems with maximum excess flow ⋮ Lexicographically optimal earliest arrival flows ⋮ Fairness in maximal covering location problems ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ A push-relabel framework for submodular function minimization and applications to parametric optimization ⋮ Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability ⋮ Theory of Principal Partitions Revisited ⋮ An Introduction to Network Flows over Time ⋮ Unnamed Item ⋮ Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints ⋮ Fairness in Resource Allocation: Foundation and Applications ⋮ A note on balanced flows in equality networks ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ Allocation rules on networks ⋮ Optimal Multicommodity Flow Through the Complete Graph with Random Edge Capacities ⋮ Extended random assignment mechanisms on a family of good sets ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ Flow sharing and bankruptcy games ⋮ A good algorithm for lexicographically optimal flows in multi-terminal networks ⋮ Fairness in routing and load balancing ⋮ Combining fairness with throughput: Online routing with multiple objectives ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ Submodular function minimization ⋮ A characterization of network representable polymatroids ⋮ Free intermediation in resource transmission ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ A Parametrized Analysis of Algorithms on Hierarchical Graphs ⋮ Partial contraflow with path reversals for evacuation planning ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Optimal building evacuation time considering evacuation routes ⋮ Eliminating transplant waiting time inequities -- with an application to kidney allocation in the USA ⋮ Structural theorems for submodular functions, polymatroids and polymatroid intersections ⋮ Submodular optimization views on the random assignment problem ⋮ Generalized lexicographically optimal flows in networks with multiple sources and sinks ⋮ Decreasing minimization on M-convex sets: background and structures ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ Fair optimization and networks: a survey ⋮ Efficient continuous-time dynamic network flow algorithms ⋮ Optimal sharing ⋮ Decreasing minimization on base-polyhedra: relation between discrete and continuous cases ⋮ Dynamic pricing and the direct-to-customer model in the automotive industry
Cites Work
This page was built for publication: Optimal flows in networks with multiple sources and sinks
