A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Application of M-Convex Submodular Flow Problem to Mathematical Economics
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Quasi M-convex and L-convex functions: quasiconvexity in discrete optimization
Discrete Applied Mathematics - Submodularity
| Hi-index | 0.01 |
This paper presents a polynomial time algorithm for solving submodular flow problems with a class of discrete convex cost functions. This class of problems is a common generalization of the submodular flow and valuated matroid intersection problems. The algorithm adopts a new scaling technique that scales the discrete convex cost functions via the conjugacy relation. The algorithm can be used to find a pair of optima in the form of the Fenchel-type duality theorem in discrete convex analysis.