“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite
optimization problems and in related convex optimization problems involving sparse positive …

This survey examines the state of the art of a variety of problems related to pseudo-Boolean
optimization, ie to the optimization of set functions represented by closed algebraic …

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are
homogeneous and/or well separated. As many types of clustering and criteria for …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

This introductory chapter explains the motivation for develo** decision diagrams as a new
discrete optimization technology. It shows how decision diagrams implement the five main …

The satis ability (SAT) problem is a core problem in mathematical logic and computing
theory. In practice, SAT is fundamental in solving many problems in automated reasoning …

Because of their complementary strengths, optimization and constraint programming can be
profitably merged. Their integration has been the subject of increasing commercial and …

Let (QP) be a 0-1 quadratic program which consists in minimizing a quadratic function
subject to linear equality constraints. In this paper, we present QCR, a general method to …