A decomposition method for minimizing quadratic pseudo-Boolean functions

DOI10.1016/0167-6377(89)90043-6zbMath0668.90065OpenAlexW2085468551MaRDI QIDQ1118533

Alain Billionnet, Brigitte Jaumard

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90043-6

zbMATH Keywords

strongly connected componentsquadratic pseudo-Boolean functions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09) Decomposition methods (49M27)

Related Items (2)

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Uniquely solvable quadratic Boolean equations
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A decomposition method for minimizing quadratic pseudo-Boolean functions