Polymatroidal flows with lower bounds

DOI10.1016/0166-218X(86)90050-8zbMATH Open0626.90025MaRDI QIDQ581209FDOQ581209

Authors: Eugene L. Lawler, Chip Martel 

Publication date: 1986

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

Recommendations

• Polymatroidal flow network models with multiple sinks
• scientific article; zbMATH DE number 1332111
• Maximal dynamic polymatroid flows and applications
• Inverse polymatroidal flow problem
• Multicommodity flows and cuts in polymatroidal networks

zbMATH Keywords

lower boundsmaximum flowmatroidscapacity boundsaugmenting path algorithmsmax-flow-min-cut theorempolymatroidal networks

Mathematics Subject Classification ID

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

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Layered Augmenting Path Algorithms
• Computing Maximal “Polymatroidal” Network Flows
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• An Algorithm for Submodular Functions on Graphs
• Flow Network Formulations of Polymatroid Optimization Problems

Cited In (6)

• Multicommodity flows and cuts in polymatroidal networks
• A note on polylinking flow networks
• Flows on C² with polynomial time one map
• Invariant sets of arcs in network flow problems
• Greedoids from flames
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581209)