Talks

• IFORS 2026
  A systematic approach to generate test instances for multi-objective mixed-integer optimization
  12.07.2026 – 17.07.2026, Vienna
• EUROPT 2026
  An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization
  08.07.2026 – 10.07.2026, Linz
• SIGOPT 2023
  A Solver for Multi-Objective Mixed-Integer Optimization Problems using Hybrid Patch Decomposition
  14.03.2023 – 16.03.2023, Cottbus
• Workshop “Vektor- und Mengenwertige Optimierung”
  A new algorithm to solve nonconvex multi-objective mixed-integer optimization problems
  03.11.2022 – 04.11.2022, Wittenberg
• EUROPT 2022
  Solving multi-objective mixed-integer optimization problems by hybrid patch decomposition
  29.07.2022 – 30.07.2022, Lisbon
• Stockholm Optimization Days 2022
  Approximating the nondominated set of multi-objective mixed-integer optimization problems by hybrid patch decomposition
  16.06.2022 – 17.06.2022, Stockholm
• Seminar on Optimization
  Using hybrid patch decomposition to solve multi-objective mixed-integer convex optimization problems
  07.06.2022, Rome
• SOfA 2022
  A deterministic solver for multiobjective mixed-integer convex and nonconvex optimization problems
  30.05.2022 – 03.06.2022, Online (Ankara)
• Oberseminar of Numerical Optimization
  A new approach to solve multi-objective mixed-integer convex optimization problems
  30.11.2021, Konstanz
• Workshop “Vektor- und Mengenwertige Optimierung”
  A hybrid patch decomposition algorithm for multi-objective mixed-integer convex optimization problems
  21.10.2021 – 22.10.2021, Wittenberg
• Seminar on Operations Research
  Computing an enclosure for (MOMICP) using a hybrid patch decomposition approach (HyPaD)
  28.09.2021, Karlsruhe
• RAMOO 2021
  Computing an enclosure for multi-objective mixed-integer convex optimization problems
  23.09.2021, Online
• EUROPT 2021
  Computing a box-coverage for multi-objective optimization problems
  07.07.2021 – 09.07.2021, Online
• Oberseminar Optimization (FSU Jena)
  Computing an enclosure to approximate the nondominated set of multi-objective optimization problems
  06.07.2021, Online
• WSOPT 2021
  Approximating the nondominated set of multi-objective optimization problems using boxes
  24.03.2021 – 25.03.2021, Online
• ANZIAM 2021
  A box approximation algorithm for multi-objective optimisation problems
  31.01.2021 – 05.02.2021, Online
• Workshop “Vektor- und Mengenwertige Optimierung”
  An approximation algorithm for multi-objective optimization problems using a box-coverage
  22.10.2020 – 23.10.2020, Wittenberg
• SIGOPT 2020
  A New Proximity Measure Based on KKT Conditions for Multiobjective Optimization Problems
  04.03.2020 – 06.03.2020, Dortmund
• Workshop “Vektor- und Mengenwertige Optimierung”
  An error measure for necessary optimality conditions for constrained multiobjective optimization problems
  24.10.2019 – 25.10.2019, Wittenberg
• Workshop “Vektor- und Mengenwertige Optimierung”
  On special classes of set optimization problems, test instances and an easy solution approach
  25.10.2018 – 26.10.2018, Wittenberg