Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs

DOI10.1287/opre.34.2.218zbMath0617.90028OpenAlexW2057927002MaRDI QIDQ3754410

Awi Federgruen, H. Groenevelt

Publication date: 1986

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ab46e0df111a51f68f861f758a50e9c5f9b156f7

zbMATH Keywords

augmenting path algorithmmultiple sinksgeneral capacitated networkgeneral preference relation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (7)

PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ A model management solution system for multicommodity network flows

This page was built for publication: Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs