The concept of M-convex function, introduced by Murota (1996), is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems.
No takes yet. Share an insight, caveat, or question.
Murota et al. (1999) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: