Submodular flow problem with a nonseparable cost function

DOI10.1007/s004930050047zbMath0947.90119OpenAlexW2158486393MaRDI QIDQ1125610

Kazuo Murota

Publication date: 8 December 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050047

zbMATH Keywords

submodular flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Convexity and Steinitz's exchange property, A constructive proof for the induction of M-convex functions through networks, Minimization of an M-convex function, The b‐bibranching problem: TDI system, packing, and discrete convexity, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization, Recent Developments in Discrete Convex Analysis, Application of M-convex submodular flow problem to mathematical economics, Nash equilibria in discrete routing games with convex latency functions, Coordinatewise domain scaling algorithm for M-convex function minimization, A capacity scaling algorithm for M-convex submodular flow, Relationship of two formulations for shortest bibranchings, Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella., Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm, Competitive Equilibrium and Trading Networks: A Network Flow Approach, Discrete convex analysis, Extension of M-convexity and L-convexity to polyhedral convex functions