A decomposition method for minimizing quadratic pseudo-Boolean functions

Authors:
Alain Billionnet;Brigitte Jaumard
Affiliations:
Institut d'Informatique d'Enterprise, Conservatoire National des Arts et Métiers, 18 allée Jean Rostand, 91002 Evry, France;GERAD and Ecole Polytechnique de Montréal, Case Postale 6079-Succursale A, Montréal, Québec, Canada, H3C 3A7
Venue:
Operations Research Letters
Year:
1989

Citing 2
Cited 1

A linear expected-time algorithm for deriving all logical conclusions implied by a set of Boolean inequalities

Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A decomposition method is proposed for minimizing quadratic pseudo-Boolean functions. The result is: minimum of f=@c"i"="1^q (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.