Polymatroidal flow network models with multiple sinks

DOI10.1002/net.3230180404zbMath0651.90026OpenAlexW2121768991MaRDI QIDQ3796942

Awi Federgruen, H. Groenevelt

Publication date: 1988

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230180404

zbMATH Keywords

expanded graphgeneral concave objective functionspolymatroidal capacity restrictionspolymatroidal flow network model

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ An algorithm for the fair resource allocation problem with a submodular constraint ⋮ Optimization and mechanism design ⋮ A characterization of network representable polymatroids ⋮ Multicommodity flows and cuts in polymatroidal networks

Cites Work

• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Fast Algorithms for Bipartite Network Flow
• Simple Ranking Methods for Allocation of One Resource
• Least d-Majorized Network Flows with Inventory and Statistical Applications
• Unnamed Item
• Unnamed Item

This page was built for publication: Polymatroidal flow network models with multiple sinks