CCASat
From MaRDI portal
Cited in
(28)- SDSAT
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- RPOLY
- NuMVC
- Runsolver
- Using the method of conditional expectations to supply an improved starting point for CCLS
- XOR local search for Boolean Brent equations
- QMaxSAT
- MiniMaxSat
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Timescales of Boolean satisfiability solver using continuous-time dynamical system
- An efficient local search framework for the minimum weighted vertex cover problem
- Local search for diversified top-\(k\) clique search problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Sparrow2011
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- WPM2
- New local search methods for partial MaxSAT
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- SCCWalk
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- SATLike
- CCLS
- CCEHC
- CCAnr
- gpuls-mwcp
- Solving the set packing problem via a maximum weighted independent set heuristic
This page was built for software: CCASat
