Variable and Value Ordering When Solving Balanced Academic Curriculum Problems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Programming Languages, D.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30835

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0110007
 http://arxiv.org/abs/cs/0110007
 Proceedings of 6th Workshop of the ERCIM WG on Constraints (Prague, June 2001)

Collections

arXiv