Improving local search for random 3-SAT using quantitative configuration checking
From MaRDI portal
Recommendations
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local search for Boolean satisfiability with configuration checking and subscore
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- Improving stochastic local search for SAT with a new probability distribution
- Captain Jack: new variable selection heuristics in local search for SAT
Cited in
(9)- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- An improved local search algorithm for 3-SAT
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- Local search for Boolean satisfiability with configuration checking and subscore
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- A vertex weighting-based double-tabu search algorithm for the classical p-center problem
- Local Search For Satisfiability Modulo Integer Arithmetic Theories
This page was built for publication: Improving local search for random 3-SAT using quantitative configuration checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455584)
