2001/10/02 by Carlos Castro, Sebastian Manzano
Computer Science · #cs.PL
published as Proceedings of 6th Workshop of the ERCIM WG on Constraints (Prague, June 2001) · 12 pages, 4 figures
arxiv created 2001/10/02 · arxiv updated 2009/11/30
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.