Good heuristics are essential for the efficiency of many interval based constraint solvers, for example, when making the decision which interval to split into pieces. In the thesis you will implement strategies for such heuristics and thoroughly analyze their behavior using computational experiments.
