Abstract“Convex analysis” is developed for functions defined on integer lattice points. We investigate the class of functions which enjoy a variant of Steinitz's exchange property. This includes linear functions on matroids, valuations on matroids (in the sense of Dress and Wenzel), and separable concave functions on the integral base polytope of submodular systems. It is shown that a functionωhas the Steinitz exchange property if and only if it can be extended to a concave functionωsuch that the maximizers of (ω+any linear function) form an integral base polytope. A Frenchel-type min–max theorem and discrete separation theorems are established which imply, as immediate consequences, Frank's discrete separation theorem for submodular functi...
Any integer-valued function with finite domain E defines, by means of an associated submodular funct...
Any integer-valued function with finite domain E defines, by means of an associated submodular funct...
Given a quasi-concave-convex function f: X × Y → R defined on the product of two convex sets we woul...
“Convex analysis” is developed for functions defined on integer lattice points. We investigate the c...
Abstract“Convex analysis” is developed for functions defined on integer lattice points. We investiga...
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer ...
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer ...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
. The concepts of L-convex function and M-convex function have recently been introduced by Murota as...
The submodular flow problem with a nonseparable cost function is considered. The objective function ...
AbstractA set of axioms of defining a matroid in terms of its bases is given by the Steinitz exchang...
We consider the problem of maximizing a nondecreasing submodular set function under a matroid constr...
In this paper, we consider the problem of maximizing a non-negative submodular function f, defined o...
In the field of nonlinear program-ming (in continuous variables) convex analysis [22, 23] plays a pi...
The weighted matroid intersection problem has recently been extended to the valuated matroid interse...
Any integer-valued function with finite domain E defines, by means of an associated submodular funct...
Any integer-valued function with finite domain E defines, by means of an associated submodular funct...
Given a quasi-concave-convex function f: X × Y → R defined on the product of two convex sets we woul...
“Convex analysis” is developed for functions defined on integer lattice points. We investigate the c...
Abstract“Convex analysis” is developed for functions defined on integer lattice points. We investiga...
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer ...
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer ...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
. The concepts of L-convex function and M-convex function have recently been introduced by Murota as...
The submodular flow problem with a nonseparable cost function is considered. The objective function ...
AbstractA set of axioms of defining a matroid in terms of its bases is given by the Steinitz exchang...
We consider the problem of maximizing a nondecreasing submodular set function under a matroid constr...
In this paper, we consider the problem of maximizing a non-negative submodular function f, defined o...
In the field of nonlinear program-ming (in continuous variables) convex analysis [22, 23] plays a pi...
The weighted matroid intersection problem has recently been extended to the valuated matroid interse...
Any integer-valued function with finite domain E defines, by means of an associated submodular funct...
Any integer-valued function with finite domain E defines, by means of an associated submodular funct...
Given a quasi-concave-convex function f: X × Y → R defined on the product of two convex sets we woul...