Main content
Top content
Research
Our main research interests are in the area of combinatorial optimization, especially in scheduling and timetabling. We develop models and efficient solution algorithms for complex optimization problems.
Methods: graph theory, linear programming, integer linear programming, constraint propagation, branch-and-bound algorithms, local search, genetic algorithms.
