Mathematik-Gebäude, Hörsaal M/E19

We survey a number of new models of robust combinatorial optimization. We mainly, but not exclusively, focus on adversarial deletion problems: Given an nominal instance of a combinatorial optimization problem and a set of scenarios, each comprised of a subset of resources (e.g., edges of a graph), the goal is to choose a solution X with the property that X-S (i.e., the solution X without the resources in S) satisfies some feasibility criterion, for every scenario S. Different definitions of the feasibility criterion, and different presentations of the scenario set give rise to a variety of largely-unexplored models.

Vortrag im Rahmen des Graduiertenkollegs 1855 'Diskrete Optimierung technischer Systeme unter Unsicherheit'

Der Vortrag findet im Rahmen des Graduiertenkollegs 1855 'Diskrete Optimierung technischer Systeme unter Unsicherheit' statt.

Dr. David Adjiashvili

Institut für Operations Research (IFOR), Departement Mathematik, ETH Zürich