scientific article; zbMATH DE number 1795723
From MaRDI portal
Publication:4550772
zbMATH Open1029.90053MaRDI QIDQ4550772FDOQ4550772
Authors: E. de Klerk, Joost P. Warners 
Publication date: 18 June 2003
Title of this publication is not available (Why is that?)
Recommendations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
- On semidefinite programming relaxations for the satisfiability problem
- On semidefinite programming relaxations of \((2+p)\)-SAT
- An improved semidefinite programming relaxation for the satisfiability problem
Cited In (10)
- Sums of squares based approximation algorithms for MAX-SAT
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
- On semidefinite programming relaxations of \((2+p)\)-SAT
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- Exact MAX-2SAT solution via lift-and-project closure
- Semidefinite programming and constraint programming
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- An efficient solver for weighted Max-SAT
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550772)
