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

Mathematics of Operations Research

Volumn 30, Issue 2, 2005, Pages 453-461

  Foldes, Stephan ^a   Hammer, Peter L ^b  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Boolean functions; Discrete derivatives; Functional equations; Functional inequalities; Local closure; Minors; Post classes; Pseudo boolean functions; Set functions; Submodularity; Supermodularity

Indexed keywords

LOCAL CLOSURE; MINORS; POST CLASSES; SET FUNCTIONS; SUBMODULARITY;

LINEAR ALGEBRA; POLYNOMIALS; SET THEORY;

BOOLEAN FUNCTIONS;

EID: 31144471753     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1040.0128     Document Type: Review

References (12)

1. Crama, Y., P. L. Hammer, R. Holzman. 1989. A characterization of a cone of pseudo-Boolean functions via supermodularity-type inequalities. P. Kall, J. Kohlas, W. Popp, C. A. Zehnder, eds. Quantitative Methoden in den Wirtschaftswissenschaften. Springer-Verlag, Berlin-Heidelberg, 53-55.
2. Fisher, M., G. Nemhauser, L. Wolsey. 1978. An analysis of the approximations for maximizing submodular set functions - I. Math. Programming 14 265-294.
3. Fujishige, S. 1991. Submodular functions and optimization. Annals of Discrete Mathematics, Vol. 47. North-Holland, Amsterdam, The Netherlands.
4. Grabisch, M., J.-L. Marichal, M. Roubens. 2000. Equivalent representations of set functions. Math. Oper. Res. 25 157-178.
5. Hammer, P. L., S. Rudeanu. 1968. Boolean Methods in Operations Research and Related Areas. Springer-Verlag, Berlin, Heidelberg, New York.
6. Iwata, S., L. Fleischer, S. Fujishige. 2001. A strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48 761-777.
7. Lovasz, L. 1983. Submodular functions and convexity. A. Bachem, M. Groetschel, B. Korte, eds., Mathematical Programming - The State of the Art. Springer, Berlin, Germany.
8. Malcev, A. I. 1971. Iterative algebras and Post varieties. The Metamathematics of Algebraic Systems, Collected Papers 1936-1967, Chapter 30. North-Holland, Amsterdam, The Netherlands.
9. Narayanan, H. 1997. Submodular functions and electrical networks. Annals of Discrete Mathematics, Vol. 54. North-Holland, Amsterdam, The Netherlands.
10. Schrijver, A. 2000. A combinatorial algorithm for minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory B 80 346-355.
11. Shapley, L. S. 1953. A value for n-person games. Ann. Math. Stud. 28 307-317.
12. Topkis, D. M. 1998. Supermodularity and Complementarity. Princeton University Press, Princeton, NJ.