Cooperative parallel SAT local search with path relinking

DOI10.1007/978-3-030-43680-3_6zbMath1484.68218OpenAlexW3016089191MaRDI QIDQ2057122

Padraigh Jarvis, Alejandro Arbelaez

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-43680-3_6

zbMATH Keywords

SATparallel local search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• ManySAT
• Paramils
• UBCSAT
• BG-WalkSAT
• CCLS
• CCEHC

Cites Work

• Unnamed Item
• BG-WalkSAT
• New local search methods for partial MaxSAT
• An overview of parallel SAT solving
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• Combining Adaptive Noise and Look-Ahead in Local Search for SAT
• ParamILS: An Automatic Algorithm Configuration Framework
• Optimal Protein Structure Alignment Using Maximum Cliques
• Theory and Applications of Satisfiability Testing
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite