Flow Network Formulations of Polymatroid Optimization Problems
From MaRDI portal
Publication:4740302
DOI10.1016/S0304-0208(08)72451-4zbMath0504.90018OpenAlexW191352186MaRDI QIDQ4740302
Charles U. Martel, Eugene L. Lawler
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
min-max theoremcapacity constraintsmax-flow min-cut theoremlinking systemsmatroid optimizationpolymatroidal network flow modelpolymatroid rank functionsproblems of gammoids
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Maximal dynamic polymatroid flows and applications, Directed submodularity, ditroids and directed submodular flows, Simple push-relabel algorithms for matroids and submodular flows, Polymatroidal flows with lower bounds, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
