Cited in
(16)- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A refined branching algorithm for the maximum satisfiability problem
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- BG-WalkSAT
- NuMVC
- QMaxSAT
- MiniMaxSat
- MaxHS
- CCLS
- SATLike
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
- Cooperative parallel SAT local search with path relinking
- WPM3
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Open-WBO-Inc
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
This page was built for software: CCEHC
