Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …

Abstract Maximum Satisfiability (MaxSAT) is a basic and important constraint optimization
problem. When dealing with both hard and soft constraints, the MaxSAT problem is referred …

Abstract Partial MaxSAT (PMS) generalizes SAT and MaxSAT by introducing hard clauses
and soft clauses. PMS and Weighted PMS (WPMS) have many important real world …

Abstract Maximum Satisfiability (MaxSAT) is a prototypical constraint optimization problem,
and its generalized version is the (Weighted) Partial MaxSAT problem, denoted as (W) PMS …

Constrained clustering extends clustering by integrating user constraints, and aims to
determine an optimal assignment under the constraints. In this paper, we propose a local …

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 …

Virtual machine (VM) provisioning is a common and critical problem in cloud computing. In
industrial cloud platforms, there are a huge number of VMs provisioned per day. Due to the …

Abstract Maximum Satisfiability (MaxSAT) has been used to solve efficiently many
combinatorial optimization problems. At recent editions of international MaxSAT Evaluation …

Abstract Maximum Satisfiability (MaxSAT) is an important NP-hard combinatorial
optimization problem with many applications and MaxSAT solving has attracted much …