Computational Geometry Challenges and Results in Multiobjective Optimization
Leiden University –
In multiobjective optimization and decision analysis, it is common to compute sets of points or polytopes that cover trade-off (hyper)surfaces. In this talk, we will look at computational geometry problems related to this and their computational complexity. Many of these results have been discovered very recently and show that the boundary between the computational problems that are tractable and intractable depends on various parameters and is very sensitive to the number of objectives.
Michael T. M. Emmerich is Associate Professor at LIACS, Leiden University is an expert in indicator-based multicriteria optimization, decision analysis, and complex network research. He is the leader of the Multicriteria Optimization and Decision Analysis (MODA) research group at LIACS – the computer science department of Leiden University. He received his doctor in the natural sciences (Dr.rer. nat.) from the Informatics Department of the Technical University of Dortmund. He successfully carried out projects as a research consultant with ICD e.V. (Germany), ACCESS e.V., RWTH Aachen, IST Lisbon, University of the Algarve (Portugal), Princeton University, and the FOM/AMOLF Institute on Fundamental Science of Matter (Amsterdam, Netherlands). He is an editorial board member of the MIT Journal on Evolutionary Computation and Steering Committee member in the EMO and EVOLVE conference series. Michael Emmerich has co-authored more than 120 articles in peer-reviewed journals and conferences. He has been general chair of three international Lorentz Centre workshops on multicriteria optimiation and one international conference on set-oriented numerics. At LIACS he is the coordinator of the European Research Center on Information Systems (ERCIS) and member of the International Society on Multicriteria Decision Analysis.
For more information: