SODA

Global constraints as graph properties on structured network of elementary constraints of the same type

Beldiceanu, Nicolas (2000) Global constraints as graph properties on structured network of elementary constraints of the same type. [SICS Report]

[img]Postscript
1578Kb
[img]
Preview
PDF
513Kb

Abstract

This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in term of graph properties that have to hold, where the graph is a structured network of same elementary constraints. Since this classification is based on the internal structure of the global constraints it is also a strong hint for the pruning algorithms of the global constraints.

Item Type:SICS Report
Uncontrolled Keywords:Constraint, Finite domain, Global constraint, Classification, Resource constraint scheduling, Graph partitioning, Timetabling
ID Code:2284
Deposited By:Vicki Carleson
Deposited On:29 Jul 2009
Last Modified:18 Nov 2009 16:04

Repository Staff Only: item control page