Minimum cost flow with set-constraints

DOI10.1002/NET.3230120102MaRDI QIDQ3936464zbMATH OpenOpenAlexFDO

Authors Refael Hassin

Publication date 1982

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230120102

zbMATH Keywords

algorithmdecompositiondual problemminimum cost network flowpolymatroid intersection problemset-constraintssubmodular functionsupermodular functions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(21)

• 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
• Flow constrained minimum cost flow problem
• A note on polylinking flow networks
• Envy-free matchings with lower quotas
• Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra
• Bisubmodular polyhedra, simplicial divisions, and discrete convexity
• A generalized-polymatroid approach to disjoint common independent sets in two matroids
• A fast cost scaling algorithm for submodular flow
• Generalizations of Hoffman's existence theorem for circulations
• A 3/2-Approximation for the Metric Many-Visits Path TSP
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
• Greedoids from flames
• Matroid-rooted packing of arborescences
• Packing mixed hyperarborescences
• Revisiting priority k-center: fairness and outliers
• A note on Frank's generalized polymatroids
• Finding feasible vectors of Edmonds-Giles polyhedra

This page was built for publication: Minimum cost flow with set-constraints

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