TY - JOUR
T1 - Coordinatewise domain scaling algorithm for M-convex function minimization
AU - Tamura, Akihisa
PY - 2005/3
Y1 - 2005/3
N2 - 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.
AB - 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.
KW - Discrete convex analysis
KW - M-convex function minimization
KW - Scaling algorithm
UR - http://www.scopus.com/inward/record.url?scp=21144433650&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=21144433650&partnerID=8YFLogxK
U2 - 10.1007/s10107-004-0522-y
DO - 10.1007/s10107-004-0522-y
M3 - Article
AN - SCOPUS:21144433650
SN - 0025-5610
VL - 102
SP - 339
EP - 354
JO - Mathematical Programming
JF - Mathematical Programming
IS - 2
ER -