Variable and Value Ordering When Solving Balanced Academic Curriculum Problems

TL;DR

This paper explores the application of constraint programming and heuristics to efficiently solve balanced academic curriculum problems, demonstrating advantages over traditional integer programming methods.

Contribution

It introduces a constraint programming approach with heuristics for solving complex balanced curriculum problems more efficiently than existing integer programming techniques.

Findings

Constraint programming effectively solves complex curriculum problems.

Heuristics significantly improve solving efficiency.

Method outperforms traditional integer programming approaches.

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.