An extended semidefinite relaxation for satisfiability

MaRDI QIDQ3515551zbMATH OpenFDO

Authors Miguel F. Anjos

Publication date 29 July 2008

zbMATH Keywords

discrete optimizationglobal optimizationsatisfiabilitysemidefinite programming

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09)

Recommendations

• Relaxations of the satisfiability problem using semidefinite programming
• Relaxations of the satisfiability problem using semidefinite programming
• On semidefinite programming relaxations for the satisfiability problem
• An improved semidefinite programming relaxation for the satisfiability problem
• scientific article; zbMATH DE number 6000615

Cited in

(12)

• An improved semidefinite programming relaxation for the satisfiability problem
• On semidefinite programming relaxations of \((2+p)\)-SAT
• Relaxations of the satisfiability problem using semidefinite programming
• On semidefinite programming relaxations for the satisfiability problem
• Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
• Exploiting semidefinite relaxations in constraint programming
• An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
• Relaxations of the satisfiability problem using semidefinite programming
• scientific article; zbMATH DE number 6000615 (Why is no real title available?)
• scientific article; zbMATH DE number 2159161 (Why is no real title available?)
• On semidefinite least squares and minimal unsatisfiability
• Extended McCormick relaxation rules for handling empty arguments representing infeasibility

Describes a project that uses

Uses Software

• Outward rotations

This page was built for publication: An extended semidefinite relaxation for satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515551)