Polymatroidal flows with lower bounds

DOI10.1016/0166-218X(86)90050-8zbMath0626.90025MaRDI QIDQ581209

Eugene L. Lawler, Charles U. Martel

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroidslower boundsmaximum flowcapacity boundsaugmenting path algorithmsmax-flow-min-cut theorempolymatroidal networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Stochastic network models in operations research (90B15)

Related Items (1)

Greedoids from flames

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Layered Augmenting Path Algorithms
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• Computing Maximal “Polymatroidal” Network Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• An Algorithm for Submodular Functions on Graphs
• Flow Network Formulations of Polymatroid Optimization Problems

This page was built for publication: Polymatroidal flows with lower bounds