Scaling algorithms for M-convex function minimization

Satoko Moriguchi, Kazuo Murota, Akiyoshi Shioura

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)


M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational results are also reported.

Original languageEnglish
Pages (from-to)922-929
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number5
Publication statusPublished - 2002 May


  • Convex function
  • Discrete optimization
  • Matroid
  • Scaling algorithm

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Scaling algorithms for M-convex function minimization'. Together they form a unique fingerprint.

Cite this