From December 6 to 9, 2017 26 scientists from Germany, Italy, Slovenia, the Netherlands and Austria gathered in Klagenfurt to present and discuss latest results on various combinatorial optimization problems.
The plenary lectures were given by Frank Vallentin and Gerhard Woeginger.
Frank Vallentin talked about colourings of infinite graphs, where harmonic analysis and convex optimization is used to obtain bounds. In Gerhard Woeginger’s we learned about hard voting problems.
The program consisted also of an open problem session where many of us posted and discussed questions they are currently working on. 13 speakers contributed to the workshop program by presenting their work on topics like bundle methods, matrix factorization ranks, or several types of quadratic problems.
Socializing, discussing problems and optimizing also took place beyond the lecture halls: at dinners we had together, with the hot wine punch at the Christkindlmarkt, during a boat trip at lake Wörthersee and during a hike through a winter wonderland to the top of Pyramidenkogel.
More information: https://aawo2017.aau.at