Markov chains are a well known tool to model temporal properties of many phenomena,
from text structure to fluctuations in economics. Because they are easy to generate …

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated
representations of combinatorial constrained problems. This new format is able to deal with …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

This paper approaches the problem of modeling optimization problems containing
substructures involving constraints on sequences of decision variables. Such constraints …

Abstract Nurse Rostering Problems (NRPs) consist of generating rosters where required
shifts are assigned to nurses over a scheduling period satisfying a number of constraints …

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 …

We present a branch-and-price algorithm to solve personalized multi-activity shift scheduling
problems. The subproblems in the column generation method are formulated using …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

The field of small satellite formations and constellations attracted growing attention, based
on recent advances in small satellite engineering. The utilization of distributed space …

Today's models for propagation-based constraint solvers require propagators as
implementations of constraints to be at least contracting and monotonic. These models do …