SODA

Pruning for the minimum constraint family and for the number of distinct values constraint family

Beldiceanu, Nicolas (2001) Pruning for the minimum constraint family and for the number of distinct values constraint family. In: Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2001), 8-10 April 2001, Wye College (Imperial College), Ashford, Kent, UK.

Full text not available from this repository.

Abstract

The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as time tabling or frequency allocation problems.

Item Type:Conference or Workshop Item (Paper)
ID Code:3064
Deposited By:INVALID USER
Deposited On:15 Jul 2008
Last Modified:18 Nov 2009 16:17

Repository Staff Only: item control page