Core-boosted linear search for incomplete MaxSAT
From MaRDI portal
Recommendations
- Improvements to core-guided binary search for MaxSAT
- Generalizing Core-Guided Max-SAT
- Iterative and core-guided maxsat solving: a survey and assessment
- Cores in core based MaxSat algorithms: an analysis
- Abstract cores in implicit hitting set MaxSat solving
- New local search methods for partial MaxSAT
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- MAX-closed semilinear constraint satisfaction
- A taxonomy of exact methods for partial Max-SAT
Cited in
(9)- Clause redundancy and preprocessing in maximum satisfiability
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Learning variable activity initialisation for lazy clause generation solvers
- SAT-based optimal classification trees for non-binary data
- An efficient local search algorithm for minimum positive influence dominating set problem
- Efficient local search for pseudo Boolean optimization
- On preprocessing for weighted MaxSAT
- Integrating multi-armed bandit with local search for MaxSAT
This page was built for publication: Core-boosted linear search for incomplete MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327238)