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

Constraint Programming is a problem-solving paradigm that establishes a clear distinction
between two pivotal aspects of a problem:(1) a precise definition of the constraints that …

This paper describes a new local search algorithm that provides very high quality solutions
to vehicle routing problems. The method uses greedy local search, but avoids local minima …

This book provides a de? nition and study of a knowledge representation and r-soning
formalism stemming from conceptual graphs, while focusing on the com-tational properties …

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

A global cardinality constraint gcc is speci ed in terms of a set of variables X= fx1;:::; xpg
which take their values in a subset of V= fv1;:::; vdg. It constrains the number of times a value …

Publisher Summary This chapter discusses that constraint reasoning involves various types
of techniques to tackle the inherent intractability of the problem of satisfying a set of …

In the last twenty years, many algorithms and heuristics were developed to find solutions in
constraint networks. Their number increased to such an extent that it quickly became …

The problem of radio frequency assignment is to provide communication channels from
limited spectral resources whilst kee** to a minimum the interference suffered by those …

The use of constraint propagation is the main feature of any constraint solver. It is thus of
prime importance to manage the propagation in an efficient and effective fashion. There are …