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