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.
- Base Polyhedron
- Convex function
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics