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

Publisher Summary This chapter provides an overview of global constraints. It discusses
different types of constraints, measures of filtering and different compromises between …

In many real-world multiobjective optimization problems one needs to find solutions or
alternatives that provide a fair compromise between different conflicting objective functions …

In the car-sequencing problem, a number of cars have to be sequenced on an assembly line
respecting several constraints. This problem was addressed by both Operations Research …

A wide range of problems can be formalized as a set of constraints that need to be satisfied.
In fact, such a model is called a constraint satisfaction problem (CSP). Another way to …

We show that some common and important global constraints like ALL-DIFFERENT and
GCC can be decomposed into simple arithmetic constraints on which we achieve bound or …

Product configuration systems are an emerging technology that supports companies in
deploying mass customization strategies. Such strategies need to cover the management of …

The Balance constraint introduced by Beldiceanu ensures solutions are balanced. This is
useful when, for example, there is a requirement for solutions to be fair. Balance bounds the …

Motivated by recent advances in quantum algorithms and gate-model quantum computation,
we introduce quantum-accelerated filtering algorithms for global constraints in constraint …

Measuring graph similarity is a key issue in many applications. We propose a new constraint-
based modeling language for defining graph similarity measures by means of constraints. It …