Home | Application | Program | Venue/Accomodation |
Algorithms for combinatorial optimization feature aspects of data science in various respects. Combinatorial optimization problems are mostly NP-hard, and this complexity reflects itself in complicated and large solution spaces. Combinatorial optimization problems often originate from real-world problems and this real-world context has an impact on the set of instances likely to ask for a solution which influences the applicability of specific algorithms. NP-hard problems often allow fast solutions for classes of instances while other classes are much harder to solve. Mapping these classes onto a space of instances provides insight and increases understanding in the problem as well as on the applicability of specific algorithms.
On each day of the PhD school, one lecturer, often assisted by a post-doc, will teach a state-of-the art topic, providing both theory and hands-on training and excercises. In addition to those teaching sessions, PhD students will get the opportunity to present and discuss their work, and there will be an invited talk by the Alexander von Humboldt Professor Yachou Jin. Last but not least, during joint meals and social activities, there will be plenty of room for socializing and networking.
Yaochu Jin Alexander von Humboldt Professor for Artificial Intelligence Bielefeld University Graph Neural Networks for Combinatorial Optimization |