scientific article; zbMATH DE number 956866
From MaRDI portal
Publication:5687275
Recommendations
Cited in
(24)- A comparison between SAT and CSP techniques
- On the relations between SAT and CSP enumerative algorithms
- Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
- Resolution versus search: Two strategies for SAT
- A logical approach to efficient Max-SAT solving
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Exact Max-SAT solvers for over-constrained problems
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Resolution versus search: Two strategies for SAT
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Approximate algorithms for generalized maximum utility problems
- Breaking cycle structure to improve lower bound for Max-SAT
- Exact algorithms for MAX-SAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Experimental and Efficient Algorithms
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- A fixed point operator for the generalised maximum satisfiability problem
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- Algorithms for the maximum satisfiability problem
- Improving exact algorithms for MAX-2-SAT
- An efficient solver for weighted Max-SAT
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 Q5687275)