Affordable Access

Variable and Value Ordering When Solving Balanced Academic Curriculum Problems

Authors
Type
Published Article
Publication Date
Submission Date
Identifiers
arXiv ID: cs/0110007
Source
arXiv
License
Unknown
External links

Abstract

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.

Statistics

Seen <100 times