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

DOI10.1016/j.dam.2007.09.021zbMath1163.90657OpenAlexW1999719247MaRDI QIDQ955309

Bruno Simeone

Publication date: 19 November 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.021

zbMATH Keywords

Boolean algebraconsensusnonlinear binary optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Boolean programming (90C09)

Related Items

Roof duality, complementation and persistency in quadratic 0–1 optimization

Cites Work

• Upper-bounds for quadratic 0-1 maximization
• Unimodular functions
• A switching algorithm for the solution of quadratic Boolean equations
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Recognition of a class of unimodular functions
• A Way to Simplify Truth Functions
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item