The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has
extensive applications. Weighted MAX-SAT instances encoded from real-world applications …

The minimum independent dominance set (MIDS) problem is an important version of the
dominating set with some other applications. In this work, we present an improved master …

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

The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …

It is well known that different solution strategies work well for different types of instances of
hard combinatorial problems. As a consequence, most solvers for the propositional …

Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to
discover interaction faults of real-world systems. Most real-world systems involve constraints …

To meet the rising demand for software customization, highly configurable software systems
play key roles in practice. Combinatorial interaction testing (CIT) is recognized as an …

The unicost version of well-known set covering problem (SCP) is central to a wide variety of
practical applications for which finding an optimal solution quickly is crucial. In this paper, we …

Two-mode stochastic local search (SLS) and focused random walk (FRW) are the two most
influential paradigms of SLS algorithms for the propositional satisfiability (SAT) problem …

To meet the increasing demand for customized software, highly configurable systems
become essential in practice. Such systems offer many options to configure, and ensuring …