Coordinatewise domain scaling algorithm for M-convex function minimization

研究成果: Article

10 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)339-354
ページ数16
ジャーナルMathematical Programming
102
発行部数2
DOI
出版物ステータスPublished - 2005 3
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

  • Applied Mathematics
  • Mathematics(all)
  • Safety, Risk, Reliability and Quality
  • Management Science and Operations Research
  • Software
  • Computer Graphics and Computer-Aided Design
  • Computer Science(all)

これを引用