Cited in
(43)- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- A novel algorithm for Max Sat calling MOCE to order
- UBCSAT
- Walksat
- BG-WalkSAT
- RPOLY
- Sat4j
- TTTPLOTS
- NuMVC
- Runsolver
- QMaxSAT
- MiniMaxSat
- Open-WBO
- CCASat
- Alchemy
- VOLT
- WPM2
- MaxHS
- Tuffy
- SCCWalk
- RockIt
- CCEHC
- New local search methods for partial MaxSAT
- Probabilistic characterization of random Max \(r\)-Sat
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Cooperative parallel SAT local search with path relinking
- WPM3
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Local search for diversified top-\(k\) clique search problem
- An improved configuration checking-based algorithm for the unicost set covering problem
- Voting on multi-issue domains with conditionally lexicographic preferences
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Open-WBO-Inc
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- gpuls-mwcp
- An efficient heuristic algorithm for solving connected vertex cover problem
This page was built for software: CCLS
