Flow Network Formulations of Polymatroid Optimization Problems

DOI10.1016/S0304-0208(08)72451-4MaRDI QIDQ4740302zbMATH OpenOpenAlexFDO

Authors Eugene L. Lawler, Chip Martel

Publication date 1982

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)72451-4

zbMATH Keywords

capacity constraintsmax-flow min-cut theoremlinking systemsmin-max theoremmatroid optimizationpolymatroidal network flow modelpolymatroid rank functionsproblems of gammoids

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited in

(5)

• Directed submodularity, ditroids and directed submodular flows
• Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
• Polymatroidal flows with lower bounds
• Simple push-relabel algorithms for matroids and submodular flows
• Maximal dynamic polymatroid flows and applications

This page was built for publication: Flow Network Formulations of Polymatroid Optimization Problems

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