AbstractInequalities are identified for subadditive (superadditive) functions of supermodular (submodular) functions. A simple adaptation yields inequalities for submultiplicative (supermultiplicative) compositions of log-supermodular (log-submodular) functions. Inequalities are also developed when the order of composition is reversed
Let L be a lattice. A function f : L → R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)...
Set-functions appear in many areas of computer science and applied mathematics, such as machine lear...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
AbstractInequalities are identified for subadditive (superadditive) functions of supermodular (submo...
AbstractLet L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x...
We introduce two new "degree of complementarity" measures: supermodular width and superadditive widt...
AbstractMaking use of the concepts of differential subordination and superordination, many subordina...
We study the ordinal content of assuming supermodularity, including conditions under which a binary ...
AbstractThis paper demonstrates a strong equivalence of all permutation polytopes corresponding to s...
We show that certain functional inequalities, e.g. Nash-type and Poincaré-type inequalities, for inf...
In this paper, we apply fractional differintegral operator and study various properties of different...
We uncover the complete ordinal implications of supermodularity on finite lattices under the assumpt...
Submodular functions are the functions that frequently appear in connection with many combi-natorial...
Recently, a strong link has been discovered between supermodularity on lattices and tractability of ...
By using of Cho–Kwon–Srivastava operator, we obtain some subordinations and superordinations results...
Let L be a lattice. A function f : L → R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)...
Set-functions appear in many areas of computer science and applied mathematics, such as machine lear...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
AbstractInequalities are identified for subadditive (superadditive) functions of supermodular (submo...
AbstractLet L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x...
We introduce two new "degree of complementarity" measures: supermodular width and superadditive widt...
AbstractMaking use of the concepts of differential subordination and superordination, many subordina...
We study the ordinal content of assuming supermodularity, including conditions under which a binary ...
AbstractThis paper demonstrates a strong equivalence of all permutation polytopes corresponding to s...
We show that certain functional inequalities, e.g. Nash-type and Poincaré-type inequalities, for inf...
In this paper, we apply fractional differintegral operator and study various properties of different...
We uncover the complete ordinal implications of supermodularity on finite lattices under the assumpt...
Submodular functions are the functions that frequently appear in connection with many combi-natorial...
Recently, a strong link has been discovered between supermodularity on lattices and tractability of ...
By using of Cho–Kwon–Srivastava operator, we obtain some subordinations and superordinations results...
Let L be a lattice. A function f : L → R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)...
Set-functions appear in many areas of computer science and applied mathematics, such as machine lear...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
DOI
Add to ORKG