9 a.m. Block 1:

Peter Dickinson: “Scaling relationship between the copositive cone and Parrilo's first level approximation”

Philipp Hungerländer: ”The Traveling Salesman Problem with Forbidden Neighborhoods on Grids”

Joachim Schauer: “Asymptotic Behaviour of the  Quadratic Knapsack Problem”

11.30 a.m. Block 2:

Renata Sotirov: “On the graph partition, max-$k$-cut and chromatic number of a graph”

Sonja Wogrin: “Optimization and modeling as decision support tools in a transitioning power system”

                                    – lunch –

2 p. m. Block 3:

Janez Povh: “Constrained polynomial optimization and semidefinite programming”

Markus Aschinger: “LoCo - A Logic for Configuration Problems”

4 p.m. Block 4:

Angelika Wiegele: "Half way to an exact solution method for k-OKP"

Malwina Duda: "Exact Subgraphs Relaxations for Max-Cut"

Ulrich Pferschy: “Complexity and Algorithms for a Shortest Path Game”