Cornet Seminar – Michael Poss – 26/11/2021
In the context of team Cornet’s seminars, Michael Poss (LIRMM) will present his research work on Optimization problems in graphs with location uncertainty on November 26, 2021, at 11:35 in the meeting room. Abstract: Many discrete optimization problems amount to select a feasible subgraph of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets. The objective is to minimize the sum of the distances in the chosen subgraph for the worst positions of the vertices in their uncertainty sets. We will present some of the results we obtained for these problems, including a numerical illustration on Steiner tree problems.