Variable and Value Ordering When Solving Balanced Academic Curriculum Problems
Carlos Castro, Sebastian Manzano · arXiv (Cornell University) · 2001
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.