Minimum cost flow with set-constraints
From MaRDI portal
Publication:3936464
DOI10.1002/net.3230120102zbMath0478.90019OpenAlexW2010580694MaRDI QIDQ3936464
Publication date: 1982
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230120102
algorithmdual problemdecompositionsubmodular functionsupermodular functionsminimum cost network flowpolymatroid intersection problemset-constraints
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
A fast cost scaling algorithm for submodular flow ⋮ A 3/2-Approximation for the Metric Many-Visits Path TSP ⋮ An out-of-kilter method for submodular flows ⋮ Generalized polymatroids and submodular flows ⋮ Directed submodularity, ditroids and directed submodular flows ⋮ An application of submodular flows ⋮ Greedoids from flames ⋮ A generalized-polymatroid approach to disjoint common independent sets in two matroids ⋮ Flow constrained minimum cost flow problem ⋮ A note on polylinking flow networks ⋮ Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra ⋮ Envy-free matchings with lower quotas ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications ⋮ A node-capacitated Okamura-Seymour theorem ⋮ Generalizations of Hoffman's existence theorem for circulations ⋮ A note on Frank's generalized polymatroids ⋮ Bisubmodular polyhedra, simplicial divisions, and discrete convexity ⋮ Finding feasible vectors of Edmonds-Giles polyhedra
Cites Work
