Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
(Redirected from Publication:5900327)
Principles and Practice of Constraint Programming – CP 2004 (scientific article; zbMATH DE number 5322991)
Principles and Practice of Constraint Programming – CP 2004 (scientific article; zbMATH DE number 5322991)
Recommendations
Cited in
(16)- Resolution for Max-SAT
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- A logical approach to efficient Max-SAT solving
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- Finding optimal satisficing strategies for and-or trees
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Minimaxsat: an efficient weighted Max-SAT solver
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- scientific article; zbMATH DE number 1114003 (Why is no real title available?)
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- \#SAT solving algorithms based on extension rule using heuristic strategies
- scientific article; zbMATH DE number 956866 (Why is no real title available?)
- Solving Max-SAT as weighted CSP
- An efficient solver for weighted Max-SAT
This page was built for publication: Principles and Practice of Constraint Programming – CP 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900327)
