On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
From MaRDI portal
(Redirected from Publication:505972)
Recommendations
- Minimaxsat: an efficient weighted Max-SAT solver
- Optimizing with minimum satisfiability
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
Cites work
- scientific article; zbMATH DE number 2084703 (Why is no real title available?)
- A study of complexity transitions on the asymmetric traveling salesman problem
- A threshold for unsatisfiability
- Boolean lexicographic optimization: algorithms \& applications
- Connections in Networks: Hardness of Feasibility Versus Optimality
- Iterative and core-guided maxsat solving: a survey and assessment
- New inference rules for Max-SAT
- Open-WBO: a modular MaxSAT solver
- Optimizing with minimum satisfiability
- Resolution-based lower bounds in MaxSAT
- SAT-based MaxSAT algorithms
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving satisfiability problems with preferences
- The first and second Max-SAT evaluations
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
This page was built for publication: On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505972)