A pseudo-Boolean consensus approach to nonlinear 0-1 optimization

Authors:
Bruno Simeone
Affiliations:
Universití di Roma "La Sapienza", Dip. Statistica, Probabilití e Statistiche Applicate, Piazzale Aldo Moro 5, 00185Rome, Italy
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 4
Cited 0

Unimodular functions

Discrete Applied Mathematics
Recognition of a class of unimodular functions

Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.04

Visualization

Abstract

It is proved that any pseudo-Boolean function f can be represented as f(x)=z+@f(x,x@?), where z is the minimum of f and @f is a polynomial with positive coefficients in the original variables x"i and in their complements x@?"i. A non-constructive proof and a constructive one are given. The latter, which is based on a generalization to pseudo-Boolean functions of the well-known Boolean-theoretical operation of consensus, provides a new algorithm for the minimization of pseudo-Boolean functions.