Global constraints as graph properties on structured network of elementary constraints of the same type
Number of Authors: 1
2000 (English)Report (Refereed)
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.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2000, 1. , 119 p.
SICS Technical Report, ISSN 1100-3154 ; 2000:01
Constraint, Finite domain, Global constraint, Classification, Resource constraint scheduling, Graph partitioning, Timetabling
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14197OAI: oai:DiVA.org:ri-14197DiVA: diva2:1035485