Abstract The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial
optimization problem of great importance in both theory and application. Local search has …

Grouping problems aim to partition a set of items into multiple mutually disjoint subsets
according to some specific criterion and constraints. Grouping problems cover a large class …

Weighted maximum satisfiability and (unweighted) partial maximum satisfiability (PMS) are
two significant generalizations of maximum satisfiability (MAX-SAT), and weighted partial …

An interesting strategy called configuration checking (CC) was recently proposed to handle
the cycling problem in local search for Minimum Vertex Cover. A natural question is whether …

We present an exact algorithm for graph coloring and maximum clique problems based on
SAT technology. It relies on four sub-algorithms that alternatingly compute cliques of larger …

Meta-heuristics are generic search methods that are used to solve challenging
combinatorial problems. We describe these methods and highlight their common features …

We present a comprehensive demonstration of how automated reasoning can assist
mathematical research, both in the discovery of conjectures and in their verification. Our …

We study $\mu_5 (n) $, the minimum number of convex pentagons induced by $ n $ points
in the plane in general position. Despite a significant body of research in understanding …

Abstract The Divide and Distribute Fixed Weights algorithm (ddfw) is a dynamic local search
SAT-solving algorithm that transfers weight from satisfied to falsified clauses in local minima …

For decades, the use of weights has proven its superior ability to improve dynamic local
search weighting algorithms' overall performance. This paper proposes a new mechanism …