Submodularity, supermodularity, and higher-order monotonicities of pseudo-boolean functions

被引:20
|
作者
Foldes, S
Hammer, PL
机构
[1] Tampere Univ Technol, Inst Math, Miami, FL 33101 USA
[2] Rutgers State Univ, Rutgers Ctr Operat Res, RUTCOR, Piscataway, NJ 08854 USA
关键词
set functions; Boolean functions; pseudo-Boolean functions; submodularity; supermodularity; discrete derivatives; Post classes; functional inequalities; functional equations; minors; local closure;
D O I
10.1287/moor.1040.0128
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Classes of set functions defined by the positivity or negativity of the higher-order derivatives of their pseudo-Boolean polynomial representations generalize those of monotone, supermodular, and submodular functions. In this paper, these classes are characterized by functional inequalities and are shown to be closed both under algebraic closure conditions and a local closure criterion. It is shown that for every m : 1, in addition to the class of all set functions, there are only three other classes satisfying these algebraic and local closure conditions: those having positive, respectively negative, mth-order derivatives, and those having a polynomial representation of degree less than m.
引用
收藏
页码:453 / 461
页数:9
相关论文
共 50 条
  • [11] PSEUDO-BOOLEAN FUNCTIONS AND THE MULTIPLICITY OF THE ZEROS OF POLYNOMIALS
    Erdelyi, Tamas
    [J]. JOURNAL D ANALYSE MATHEMATIQUE, 2015, 127 : 91 - 108
  • [12] Axiomatizations of Lovasz extensions of pseudo-Boolean functions
    Couceiro, Miguel
    Marichal, Jean-Luc
    [J]. FUZZY SETS AND SYSTEMS, 2011, 181 (01) : 28 - 38
  • [13] On Boolean functions encodable as a single linear Pseudo-Boolean constraint
    Smaus, Jan-Georg
    [J]. INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2007, 4510 : 288 - 302
  • [14] PARTIAL DERIVATIVES OF GENERALIZED PSEUDO-BOOLEAN FUNCTIONS
    GHILEZAN, C
    [J]. DISCRETE APPLIED MATHEMATICS, 1982, 4 (01) : 37 - 45
  • [15] Characterization of rankings generated by pseudo-Boolean functions
    Unanue, Imanol
    Merino, Maria
    Lozano, Jose A.
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2024, 86
  • [16] Pseudo-boolean functions and the multiplicity of the zeros of polynomials
    Tamás Erdélyi
    [J]. Journal d'Analyse Mathématique, 2015, 127 : 91 - 108
  • [17] Inferring Boolean functions via higher-order correlations
    Markus Maucher
    David V. Kracht
    Steffen Schober
    Martin Bossert
    Hans A. Kestler
    [J]. Computational Statistics, 2014, 29 : 97 - 115
  • [18] BOOLEAN FUNCTIONS SATISFYING HIGHER-ORDER PROPAGATION CRITERIA
    PRENEEL, B
    GOVAERTS, R
    VANDEWALLE, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 547 : 141 - 152
  • [19] Inferring Boolean functions via higher-order correlations
    Maucher, Markus
    Kracht, David V.
    Schober, Steffen
    Bossert, Martin
    Kestler, Hans A.
    [J]. COMPUTATIONAL STATISTICS, 2014, 29 (1-2) : 97 - 115
  • [20] An analysis of the (μ+l) EA on simple pseudo-Boolean functions
    Witt, C
    [J]. GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2004, PT 1, PROCEEDINGS, 2004, 3102 : 761 - 773