Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions

DOI10.1287/moor.1040.0128zbMath1082.90064OpenAlexW2064047416MaRDI QIDQ5704231

Peter L. Hammer, Stephan Foldes

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1040.0128

zbMATH Keywords

supermodularitysubmodularityBoolean functionsfunctional equationsfunctional inequalitiesminorslocal closureset functionspseudo-Boolean functionsPost classesdiscrete derivatives

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09) Boolean functions (06E30)

Related Items (10)

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Higher order monotonicity and submodularity of influence in social networks: from local to global ⋮ An accelerated continuous greedy algorithm for maximizing strong submodular functions ⋮ On the volume of the Minkowski sum of zonoids ⋮ Locally monotone Boolean and pseudo-Boolean functions ⋮ Functional ANOVA, ultramodularity and monotonicity: applications in multiattribute utility theory ⋮ Algebraic and topological closure conditions for classes of pseudo-Boolean functions ⋮ The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions ⋮ Axiomatic characterizations of probabilistic and cardinal-probabilistic interaction indices ⋮ Differential approximation schemes for half-product related functions and their scheduling applications

This page was built for publication: Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions