Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems

MaRDI QIDQ3429015zbMATH OpenFDO

Authors Miguel F. Anjos

Publication date 30 March 2007

zbMATH Keywords

approximation algorithmslifting proceduressemidefinite relaxations

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• scientific article; zbMATH DE number 6000615
• An improved semidefinite programming relaxation for the satisfiability problem
• On semidefinite programming relaxations for the satisfiability problem
• scientific article; zbMATH DE number 1795723
• scientific article; zbMATH DE number 2159161

Cited in

(13)

• Iterative and core-guided maxsat solving: a survey and assessment
• Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
• Semidefinite programming based approaches to the break minimization problem
• scientific article; zbMATH DE number 6000615 (Why is no real title available?)
• scientific article; zbMATH DE number 1336257 (Why is no real title available?)
• scientific article; zbMATH DE number 1795723 (Why is no real title available?)
• On semidefinite least squares and minimal unsatisfiability
• Theory and Applications of Satisfiability Testing
• Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Empirical Properties of Optima in Free Semidefinite Programs
• Sums of squares based approximation algorithms for MAX-SAT

Describes a project that uses

Uses Software

• SDPT3
• SATLIB
• MAX-2-SAT

This page was built for publication: Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems

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