Polymatroidal flows with lower bounds

DOI10.1016/0166-218X(86)90050-8MaRDI QIDQ581209zbMATH OpenFDO

Authors Eugene L. Lawler, Chip Martel

Publication date 1986

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3885621 (Why is no real title available?)
• scientific article; zbMATH DE number 3906513 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• An Algorithm for Submodular Functions on Graphs
• Computing Maximal “Polymatroidal” Network Flows
• Flow Network Formulations of Polymatroid Optimization Problems
• Layered Augmenting Path Algorithms
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(5)

• Greedoids from flames
• Flows on C² with polynomial time one map
• A note on polylinking flow networks
• scientific article; zbMATH DE number 4041594 (Why is no real title available?)
• Invariant sets of arcs in network flow problems

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)