swMATH12924MaRDI QIDQ24847FDOQ24847
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/S0004370213000921
Cited In (28)
- Solving the set packing problem via a maximum weighted independent set heuristic
- 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
- XOR local search for Boolean Brent equations
- gpuls-mwcp
- An efficient local search framework for the minimum weighted vertex cover problem
- New local search methods for partial MaxSAT
- SDSAT
- RPOLY
- NuMVC
- Runsolver
- QMaxSAT
- MiniMaxSat
- Sparrow2011
- Timescales of Boolean satisfiability solver using continuous-time dynamical system
- WPM2
- SCCWalk
- CCLS
- CCEHC
- SATLike
- CCAnr
- 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
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Using the method of conditional expectations to supply an improved starting point for CCLS
- CCAnr: a configuration checking based local search solver for non-random satisfiability
This page was built for software: CCASat
