M-Convex Function on Generalized Polymatroid

Authors:
Kazuo Murota;Akiyoshi Shioura
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
1999

Citing 0
Cited 14

Discrete Polymatroids

Journal of Algebraic Combinatorics: An International Journal
Application of M-Convex Submodular Flow Problem to Mathematical Economics

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Gross substitution, discrete convexity, and submodularity

Discrete Applied Mathematics - Submodularity
Quasi M-convex and L-convex functions: quasiconvexity in discrete optimization

Discrete Applied Mathematics - Submodularity
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities

Discrete Applied Mathematics - Submodularity
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem

Discrete Applied Mathematics
A general two-sided matching market with discrete concave utility functions

Discrete Applied Mathematics
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis

Mathematics of Operations Research
Substitute valuations: Generation and structure

Performance Evaluation
A general two-sided matching market with discrete concave utility functions

Discrete Applied Mathematics
Convexity and optimization of condense discrete functions

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints

ESA'11 Proceedings of the 19th European conference on Algorithms
Substitutes and complements in network flows viewed as discrete convexity

Discrete Optimization
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.