A pdf of the program can be found here.

The group photo can be found here.

**June 24, 8:30-09:00 – Registration
June 24, 9:00-18:00 – Scientific Program
**

**Scientific Program:**

**9:00 – 10:00 Opening and Keynote I
**Chair: Matthias Ehrgott

09:00 – 09:10: Opening

09:10 – 10:00: Gabriele Eichfelder (Technische Universität Ilmenau).

**Multi-objective decision uncertainty and set optimization with the set approach** – (slides)

(Abstract)

**10:00 – 10:10 Break**

**10:10 – 11:25 Session 1 – New Exact Solution Algorithms
**Chair: Michael Stiglmayr

10:10 – 10:35: Jörg Fliege (University of Southampton).

**An SQP-type method for constrained and unconstrained nonlinear multiobjective optimization** – (slides)

(Abstract)

10:35 – 11:00: Ethan Liu (Lancaster University).

**Primal and Dual Methods for Linear Optimisation over the Non-dominated Set of a Multi-objective Linear Programme and Computing the Nadir Point** – (slides)

(Abstract)

11:00 – 11:25: Sune Lauth Gadegaard (Aarhus Universitet).

**Bound set based branch-and-cut algorithms for bi-objective combinatorial optimization problems** – (slides)

(Abstract)

We propose a cutting plane algorithm used to strengthen the lower bound sets, and we show how the explicitly generated lower bound sets can be updated so the bi-objective LP relaxation does not need to be solved at each branching node. Furthermore, we show how the newly proposed Pareto branching strategy can be strengthened to what we call extended Pareto branching.

We conclude by presenting results obtained with the algorithms and compare them to an implementation of the two-phase method.

**11:25 – 11:40 Coffee Break**

**11:40 – 12:40 Session 2 – Representative Sets
**Chair: Alexander Engau

11:40 – 12:10: Tobias Kuhn (Technische Universität Kaiserslautern).

**A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions** – (slides)

(Abstract)

12:10 – 12:40: Michael Stiglmayr (Bergische Universität Wuppertal).

**Representation of the non-dominated set of multiobjective combinatorial optimization problems** – (slides)

(Abstract)

**12:40 – 12:50 Some Information
12:50 – 14:00 Lunch Break**

**14:00 – 15:30 Session 3 – Applications and Complexity
**Chair: Marc Goerigk

14:00 – 14:30: Britta Schulze (Bergische Universität Wuppertal).

**Unconstrained Binary Multiobjective Optimization: Weight Space Decomposition, Arrangements of Hyperplanes and Zonotopes** – (slides)

(Abstract)

14:30 – 15:00: Alexander Engau (University of Colorado Denver).

**Improved discriminant analysis using multi-hyperplane separation and multi-criteria optimization** – (slides)

(Abstract)

15:00 – 15:30: Alain Zemkoho (University of Southampton).

**Multiobjective bilevel optimization: A set valued optimization view point** – (slides)

(Abstract)

**15:30 – 15:50 Coffee Break**

**15:50 – 16:50 Session 4 – Uncertainty and Multi-Objective Optimisation
**Chair: Jörg Fliege

15:50 – 16:20: Corinna Krüger (Georg-August-Universität Göttingen).

**On Decision Uncertainty in Multiobjective Linear Programming** – (slides)

(Abstract)

We present two ways of generalizing their definition of the robustness gap (RG) from single-objective to multiobjective optimization. On the one hand we quantify the RG by the distance between Pareto sets. On the other hand, the RG is considered as the objective value of a quadratic program. We show that both concepts are closely related with each other.

16:20 – 16:50: Marc Goerigk (Lancaster University).

**Robust and Multiobjective Optimisation: Opportunities and Challenges** – (slides)

(Abstract)

**16:50 – 17:00 Break**

**17:00 – 18:00 Keynote II and Closing**

Chair: Matthias Ehrgott

17:00 – 17:50: Firdevs Ulus (Bilkent Üniversitesi).

**Algorithms for Convex Vector Optimization Problems ** – (slides)

(Abstract)