Improving Unsatisfiability-Based Algorithms for Boolean Optimization
From MaRDI portal
Recommendations
- Satisfiability-based algorithms for Boolean optimization
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Search techniques for SAT-based Boolean optimization
- scientific article; zbMATH DE number 1903342
- scientific article; zbMATH DE number 2090309
- scientific article; zbMATH DE number 38107
- scientific article; zbMATH DE number 776082
- Improved algorithms for the general exact satisfiability problem
- Optimization, randomized approximability, and Boolean constraint satisfaction problems
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
Cited in
(10)- Satisfiability-based algorithms for Boolean optimization
- Iterative and core-guided maxsat solving: a survey and assessment
- Algorithms for Weighted Boolean Optimization
- scientific article; zbMATH DE number 1903342 (Why is no real title available?)
- scientific article; zbMATH DE number 2090309 (Why is no real title available?)
- An overview of parallel SAT solving
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Theory and Applications of Satisfiability Testing
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- Dynamic symmetry-breaking for Boolean satisfiability
This page was built for publication: Improving Unsatisfiability-Based Algorithms for Boolean Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930588)