A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533): Difference between revisions

A decomposition method is proposed for minimizing quadratic pseudo- Boolean functions. The result is: minimum of \(f=\sum^{q}_{i=1}\) (minimum of \(f_ i)\), where the function f is a sum of quadratic monomials, \(f_ i\) is a sum of monomials of f and each monomial of f appears in at most one \(f_ i\).