Effiziente Algorithmen und Kombinatorische Optimierung
The working group on Efficient Algorithms and Combinatorial Optimization focuses on the research on efficient algorithms for graph problems, local and global search, and single and multi objective optimization methods and their application. A significant example is solving the timetabling problem of the FAU’s School of Engineering. For all offered teaching activities, rooms and timeslots must be determined with respect to many constraints (e.g., room size, availability of teaching personnel, etc.). The method developed at our chair generates, for extremely large problem instances, very good solutions in very short time.