Capacity scaling algorithm for scalable M-convex submodular flow problems

DOI10.1080/1055678031000099178MaRDI QIDQ3046542zbMATH OpenOpenAlexFDO

Authors Satoko Moriguchi, Kazuo Murota

Publication date 12 August 2004

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/1055678031000099178

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A capacity scaling algorithm for M-convex submodular flow
• Integer Programming and Combinatorial Optimization
• A capacity scaling algorithm for convex cost submodular flows
• A faster capacity scaling algorithm for minimum cost submodular flow
• Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.

Cited in

(12)

• Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
• Applications of discrete convex analysis to mathematical economics
• Coordinatewise domain scaling algorithm for M-convex function minimization
• A capacity scaling algorithm for M-convex submodular flow
• A general two-sided matching market with discrete concave utility functions
• Substitutes and complements in network flows viewed as discrete convexity
• Monotonicity in steepest ascent algorithms for polyhedral L-concave functions
• A capacity scaling algorithm for the constrained maximum flow problem
• Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
• Competitive equilibrium and trading networks: a network flow approach
• Data Center Scheduling, Generalized Flows, and Submodularity
• Integer Programming and Combinatorial Optimization

This page was built for publication: Capacity scaling algorithm for scalable M-convex submodular flow problems

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