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.
@article{arxiv.cs/0110007,
title = {Variable and Value Ordering When Solving Balanced Academic Curriculum Problems},
author = {Carlos Castro and Sebastian Manzano},
journal= {arXiv preprint arXiv:cs/0110007},
year = {2007}
}