Variable and Value Ordering When Solving Balanced Academic Curriculum Problems

Simple item page
dc.creatorCastro, Carlos
dc.creatorManzano, Sebastian
dc.date2001-10-02
dc.date.accessioned2026-07-07T03:17:44Z
dc.date.available2026-07-07T03:17:44Z
dc.descriptionIn 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.
dc.description12 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0110007
dc.identifierhttp://arxiv.org/abs/cs/0110007
dc.identifierProceedings of 6th Workshop of the ERCIM WG on Constraints (Prague, June 2001)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30835
dc.subjectProgramming Languages
dc.subjectD.3
dc.titleVariable and Value Ordering When Solving Balanced Academic Curriculum Problems
dc.typetext

Files

Collections

arXiv