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 reviews that number of operations research (OR) methods
have found their way into constraint programming (CP). This development is entirely natural …

Relaxed decision diagrams have recently been used in constraint programming to improve
constraint propagation and optimization reasoning. In most applications, however, a …

We present an overview of the integration of constraint programming (CP) and operations
research (OR) to solve combinatorial optimization problems. We interpret CP and OR as …

Constraint propagation is inherently restricted to the local information that is available to
each propagator. We propose to improve the communication between constraints by …

M. Sellmann showed that CP-based Lagrangian relaxation gave good results but the
interactions between the filtering algorithms and the Lagrangian multipliers were quite …

We propose a polyhedral cutting plane procedure for computing a lower bound on the
optimal solution to multi-agent path finding (MAPF) problems. We obtain our cuts by …

Several constraint programming (CP) models, based on Lagrangian relaxation (LR), have
been introduced to solve the traveling salesman problem (TSP). In this thesis, we define …

Abstract The Golomb Ruler Problem asks to position n integer marks on a ruler such that all
pairwise distances between the marks are distinct and the ruler has minimum total length. It …

Les recherches présentées dans cette thèse portent sur la modélisation et la résolution de
systèmes de contraintes, en considérant aussi bien l'aspect théorique que l'aspect pratique …