We present a polynomial time scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized as playing a fundamental role in tractable cases of discrete optimization. The algorithm is applicable also to a variant of quasi M-convex functions.
|Number of pages||16|
|Publication status||Published - 2005 Mar|
- Discrete convex analysis
- M-convex function minimization
- Scaling algorithm
ASJC Scopus subject areas