Variable and Value Ordering When Solving Balanced Academic Curriculum Problems
arXiv:cs/0110007
Abstract
In this paper we present the use of Constraint Programming for solving balanced academic curriculum problems. We discuss the important role that heuristics play when solving a problem using a constraint-based approach. We also show how constraint solving techniques allow to very efficiently solve combinatorial optimization problems that are too hard for integer programming techniques.
12 pages, 4 figures