Efficient Propagators for Global Constraints
Abstract
We study in this thesis three well known global constraints. The All-Different constraint restricts a set of variables to be assigned to distinct values. The <em>global cardinality constraint</em> (GCC) ensures that a value <em>v</em> is assigned to at least <em>l<sub>v</sub></em> variables and to at most <em>u<sub>v</sub></em> variables among a set of given variables where <em>l<sub>v</sub></em> and <em>u<sub>v</sub></em> are non-negative integers such that <em>l<sub>v</sub></em> ≤ <em>u<sub>v</sub></em>. The Inter-Distance constraint ensures that all variables, among a set of variables <em>x</em><sub>1</sub>, . . . , <em>x<sub>n</sub></em>, are pairwise distant from <em>p</em>, i. e. |<em>x<sub>i</sub></em> - <em>x<sub>j</sub></em>| ≥ <em>p</em> for all <em>i</em> ≠ <em>j</em>. The All-Different constraint, the GCC, and the Inter-Distance constraint are largely used in scheduling problems. For instance, in scheduling problems where tasks with unit processing time compete for a single resource, we have an All-Different constraint on the starting time variables. When there are <em>k</em> resources, we have a GCC with <em>l<sub>v</sub></em> = 0 and <em>u<sub>v</sub></em> = <em>k</em> over all starting time variables. Finally, if tasks have processing time <em>t</em> and compete for a single resource, we have an Inter-Distance constraint with <em>p</em> = <em>t</em> over all starting time variables. We present new propagators for the All-Different constraint, the GCC, and the Inter-Distance constraint i. e. , new filtering algorithms that reduce the search space according to these constraints. For a given consistency, our propagators outperform previous propagators both in practice and in theory. The gains in performance are achieved through judicious use of advanced data structures combined with novel results on the structural properties of the constraints.
Collections
Cite this version of the work
Claude-Guy Quimper
(2006).
Efficient Propagators for Global Constraints. UWSpace.
http://hdl.handle.net/10012/2916
Other formats
Related items
Showing items related by title, author, creator and subject.
-
Information Theoretic Aspects of Wireless Networks with Coverage Constraint
Mirghaderi, Seyed Reza (University of Waterloo, 2007-09-18)A wireless multicast network with a stringent decoding delay constraint and a minimum coverage requirement is characterized when the fading channel state information is available only at the receiver side. In the first ... -
Incremental Timing-Driven Placement with Displacement Constraint
Jesuthasan, Jude Arun Selvan (University of Waterloo, 2015-07-10)In the modern deep-submicron Very Large Integrated Circuit(VLSI) design flow intercon- nect delays are becoming major limiting factor for timing closure. Traditional placement algorithms such as routability-driven placement ... -
Quadratic Loss Minimization in a Regime Switching Model with Control and State Constraints
Ramchandani, Pradeep (University of Waterloo, 2015-04-09)In this thesis, we address a convex stochastic optimal control problem in mathematical finance, with the goal of minimizing a general quadratic loss function of the wealth at close of trade. We study this problem in the ...