Local Search

A Study of Parallel Continuous Local Search

This study investigates parallel Continuous Local Search (CLS) as a solution approach for Boolean satisfiability problems with symmetric pseudo-Boolean constraints. Empirical findings indicate that redundant constraints can inhibit convergence, CLS shows promise as a sub-solver in hybrid settings, and local search rapidly converges to a stable distribution of solution quality.