Program 2014


September 11, 18:00-21:00 – Welcome Reception
September 12, 9:00-18:00 – Scientific Program
September 12, 19:30 – Workshop Dinner


Scientific Program:

9:00 – 10:00 Opening and Keynote I

9:10 – 10:00: Matthias Ehrgott, Lancaster University Management School:
Bridging the Gap Between Real-world Decision Making and Mathematics: Multiobjective Optimisation in Action (Abstract)


10:00 – 10:10 Break

10:10 – 11:25 Session 1 – Applications I

10:10 – 10:35: Axel Werner, Zuse-Institut Berlin:
Solving ILPs with three and more objectives (Abstract)
10:35 – 11:00: Sebastian Schenker, Zuse-Institut Berlin:
Multi-criteria linear programming with reverse search (Abstract)
11:00 – 11:25: Fabien Tricoire, University of Vienna:
Linear programming for bi-objective stochastic logistics (Abstract)


11:25 – 11:40 Coffee Break

11:40 – 13:10 Session 2 – Branch-and-Bound Algorithms

11:40 – 12:10: Valentina Cacchiani, University of Bologna:
A branch-and-bound algorithm for convex multi-objective Mixed Integer Non-Linear Programming Problems (Abstract)
12:10 – 12:40: Pietro Belotti, FICO:
A branch-and-bound algorithm for biobjective mixed integer linear optimization (Abstract)
12:40 – 13:10: Thomas Riis Stidsen, Technical University of Denmark:
Parallelization of Multi-Objective Branch & Bound Algorithms (Abstract)


13:10 – 14:00 Lunch Break

14:00 – 15:30 Session 3 – Optimization with Three or More Objectives

14:00 – 14:30: Fritz Bökler, Technische Universität Dortmund:
Running Time Analyses of Benson Type Algorithms with an Application to Multiobjective Combinatorial Optimization Problems (Abstract)
14:30 – 15:00: Kerstin Dächert, University of Wuppertal:
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Abstract)
15:00 – 15:30: Jonas Ide, Georg-August-Universität Göttingen:
Set-based minmax robust efficiency for uncertain multi-objective optimization (Abstract)


15:30 – 15:50 Coffee Break

15:50 – 16:50 Session 4 – Applications II

15:50 – 16:20: Marta Pascoal, University of Coimbra:
Finding bicriteria shortest pairs of disjoint paths: related problems and algorithms (Abstract)
16:20 – 16:50: Nicolas Jozefowiez, Université de Toulouse:
On the use of column generation for bi-objective vehicle routing problems (Abstract)


16:50 – 17:00 Break

17:00 – 18:00 Keynote II and Closing
17:00 – 17:50: Anthony Przybylski and Xavier Gandibleux, University of Nantes:
Multi-objective branch and bound: survey, architecture, application
(Abstract)