CCLS
From MaRDI portal
Cited in
(43)- Open-WBO-Inc
- UBCSAT
- Walksat
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- BG-WalkSAT
- An efficient heuristic algorithm for solving connected vertex cover problem
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- RPOLY
- Sat4j
- TTTPLOTS
- NuMVC
- Probabilistic characterization of random Max r-Sat
- Cooperative parallel SAT local search with path relinking
- Runsolver
- A novel algorithm for Max Sat calling MOCE to order
- QMaxSAT
- MiniMaxSat
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Open-WBO
- 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
- An improved configuration checking-based algorithm for the unicost set covering problem
- Local search for diversified top-\(k\) clique search problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Voting on multi-issue domains with conditionally lexicographic preferences
- CCASat
- Alchemy
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- VOLT
- WPM2
- New local search methods for partial MaxSAT
- MaxHS
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Tuffy
- SCCWalk
- Breaking cycle structure to improve lower bound for Max-SAT
- RockIt
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- CCEHC
- gpuls-mwcp
- WPM3
This page was built for software: CCLS
