- Full text PDF available (3)
- This year (1)
- Last 5 years (8)
- Last 10 years (12)
Labeling is crucial in the performance of solving timetabling problems with constraint programming. Traditionally , labeling strategies are based on static and dynamic information about variables and their domains, and selecting variables and values to assign. However, the size of combinatorial problems tractable by these techniques is limited. In this… (More)
In this paper we define interval-valued relations. It is defined reflexive, symmetric and T-transitive properties of interval-valued relations, and the transitive closure of an interval-valued relation. Finally, we propose a algorithm to compute the transitive closure. Some examples are given and some properties are studied.