Will take place online, wednesdays 12-14 Uhr / 12-2 pm. Please register via the platform ISIS: https://isis.tu-berlin.de/course/view.php?id=25814
Puzzles and games have always been a testbed for algorithmic ideas. Vasek Chvátal once called solving the traveling salesman problem a competitive sport. There is a reason why DeepMind invested so much effort into playing Go. In the end, modeling a real-world problem is done from the same components as puzzles are. It is important to realize that integer programming is one of the few paradigms where declarative programming actually works. We just have to precisely describe the solution we want—no need to program how to find the solution or provide thousands of examples to learn from. Still, in many cases, the result is computed much faster than by complete enumeration. In this seminar, we will look at how to model different puzzles, games, and real-world problems as (mixed) integer (linear/quadratic/non-linear) problems and see how well we can solve them.
ADM I is required for this seminar. Unless all participants want to do it in German, it will be held in English. Very likely it will be online (zoom). Otherwise we might organize it as a block seminar. We will decide this at one of the first meetings.
