Minimization of an M-convex function

Akiyoshi Shioura

Research output: Contribution to journalArticlepeer-review

26 Citations (Scopus)


We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.

Original languageEnglish
Pages (from-to)215-220
Number of pages6
JournalDiscrete Applied Mathematics
Issue number1-3
Publication statusPublished - 1998 May 15
Externally publishedYes


  • Base Polyhedron
  • Convex function
  • Matroid
  • Minimization

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Minimization of an M-convex function'. Together they form a unique fingerprint.

Cite this