Research AG Kombinatorische Algorithmen

	AG Kombinatorische Algorithmen
	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. Schedule

Special topics:

Complexity
Resource-constrained project scheduling
Scheduling and transportation
Sports league scheduling
Timetabling
Applications

Last update: 29.02.2008 (SK)