CCASat

swMATH12924MaRDI QIDQ24847FDOQ24847

Author name not available (Why is that?)

Described by source

• Local search for Boolean satisfiability with configuration checking and subscore

Cited In (14)

• 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
• An efficient local search framework for the minimum weighted vertex cover problem
• CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
• New local search methods for partial MaxSAT
• Timescales of Boolean satisfiability solver using continuous-time dynamical system
• 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

This page was built for software: CCASat