Research Presentation

Solving an On-line Vehicle Routing Problem with Structured Time Windows for one of the World’s Largest Grocery Retailers.

20th Logistics Research Austria Meeting, Alpen-Adria-Universität Klagenfurt, Austria.

Vehicle Routing Problems with Structured Time Windows.

Institute of Statistic and Operations Research, University of Vienna, Austria.

The Traveling Salesperson Problem with Forbidden Neighborhoods on 3D Grids.

Institute of Optimization and Discrete Mathematics, Graz University of Technology, Austria.

Active Set Methods for Convex Quadratic Problems with Bounds and Linear Complementarity Problems.

Institute of Statistic and Operations Research, University of Vienna, Austria.

The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 2D and 3D Grids.

ISOR-Colloquium, University of Vienna, Austria.

Solving an On-line Vehicle Routing Problem for one of the World’s Largest Grocery Retailers.

DK Seminar of the Karl Popper College, Alpen-Adria-Universität Klagenfurt, Austria.

Globally Convergent Active Set Methods for Convex Quadratic Problems with Simple Bounds.

MIT Seminar in Nonlinear Optimization, Cambridge, USA.

Exact Approaches to Row Layout Problems.

Oberseminar on Discrete Optimization, Technical University Dortmund, Germany.

An SDP Approach to Circular and Multi-Row Facility Layout.

Technical University Chemnitz, Germany.

Semidefinite Approaches to Ordering Problems.

GERAD-Mprime Seminar in Optimization, Polytechnique Montréal, Canada.

A Feasible Active Set Method for Convex Problems with Simple Bounds.

Institute of Mathematics and Scientific Computing, University of Graz, Austria.

Solution Approaches for Equidistant Double- and Multi-row Facility Layout Problems.

22nd International Symposium on Mathematical Programming, Pittsburgh, USA.

A feasible active set method for box-constrained convex problems.

SIAM Conference on Optimization, San Diego, USA.

The Price of Cooperation in Differential Games.

IFIP 2013, System Modelling and Optimization, Klagenfurt, Austria.

SDP Approaches to some Facility Layout Problems.

21st International Symposium on Mathematical Programming, Berlin, Germany.

Semidefinite Relaxations of Ordering Problems.

SIAM Conference on Optimization, Darmstadt, Germany.

The Role of Science in Tomorrow’s World.

40-Year-Celebration of the Austrian Research Community (Österreichische Forschungsgemeinschaft (ÖFG)), Vienna, Austria.

On a New Modelling Approach for Circular Layouts and Its Practical Advantages.

IEEE IEEM 2017 Conference, Singapore, Singapore.

On the Slot Optimization Problem in On-Line Vehicle Routing.

International Conference of the German OR Society 2017, Berlin, Germany.

Optimizing a Fleet of Vehicles for Efficient and Customer-friendly Grocery Delivery.

INFORMS Conference on Business Analytics & OR, Las Vegas, USA.

A Feasible Active Set Method for Linear Complementarity Problems.

4th Alpen-Adria Workshop on Optimization 2016, Klagenfurt, Austria.

The Traveling Salesman Problem with Forbidden Neighborhoods on Grids.

3rd Alpen-Adria Workshop on Optimization 2015, Klagenfurt, Austria.

An Infeasible Active Set Method with Step Size Control.

Optimization 2014, Guimarães, Portugal.

An SDP Approach to the Parallel Row Ordering Problem.

20th Conference of the International Federation of OR Societies, Barcelona, Spain.

The Checkpoint Ordering Problem.

12th EUROPT Workshop on Advances in Continuous Optimization, Perpignan, France.

A Feasible Active Set Method for Box-Constrained Convex Problems.

SIAM Conference on Optimization, San Diego, USA.

SDP Relaxations for the Linear Ordering and Traveling Salesman Problem.

27th ECCO Conference, Munich, Germany.

An SDP Approach to the Directed Circular Facility Layout Problem.

7th IFAC Conference on Manufacturing Modelling, Management, and Control, Sankt Petersburg, Russia.

An SDP Approach for Complex Facility Layout Structures.

International Conference of the German OR Society 2012, Hannover, Germany.

A Comparison of Approaches for Ordering Problems.

Future Research in Combinatorial Optimization 2012 (FRICO), Berlin, Germany.

A Semidefinite Optimization Approach to Multi-Row Facility Layout.

25th European Conference on Operational Research (EURO), Vilnius, Lithuania.

An SDP Approach to Single-Row and Space-Free Multi-Row Facility Layout.

25th ECCO Conference, Antalya, Turkey.

Exact Approaches to Mulit-level Vertical Orderings.

2nd Alpen-Adria Workshop on Optimization 2011, Klagenfurt, Austria.

An SDP Approach to Multi-level Crossing Minimization.

Algorithm Engineering & Experiments 2011, San Francisco, California, USA.

An SDP Approach to Multi-level Crossing Minimization.

15th Combinatorial Optimization Workshop, Aussois, France.

An SDP Approach to Quadratic Ordering Problems.

Future Research in Combinatorial Optimization 2010 (FRICO), Graz, Austria.

Nonstandard active set methods for convex problems with simple bounds.

1st Alpen-Adria Workshop on Optimization, Klagenfurt, Austria.

N-Person Dynamic Stackelberg Affine-Quadratic Difference Games.

35th Macromodels International Conference, Warsaw, Poland

N-Person Dynamic Stackelberg Affine-Quadratic Difference Games.

13th International Symposium on Dynamic Games and Applications, Wroclaw, Poland.

N-Person Dynamic Stackelberg Open-Loop Difference Games.

14th International Conference on Computing in Economics and Finance, Paris, France.

New Active Set Methods for Nonlinear Convex Optimization Problems.

2nd Postgraduate Student & Young Faculty Conference, Klagenfurt, Austria.

Who is the best monster?

Traveling Salesman Problem with Forbidden Neighborhoods, Interactive Presentation at the Long Night of Research.

Mathematics in practice: Optimized last-mile grocery delivery.

Vehicle Routing Problem, Presentation for pupils at the open house day of the Alpen-Adria-Universität Klagenfurt.

Studying mathematics in Klagenfurt and optimization projects in practice.

Talks in high schools.

Who is jumping the best?

(Almost) Closed Knight’s Tours on Regular Grids, Interactive Presentation at the Long Night of Research.

Who can build the best city?

Quadratic Assignment Problem, Workshop for several school classes at the Alpen-

Adria-Universität Klagenfurt.

Semidefinite Programming and its Famous Applications in Mathematics and Computer Science.

Workshop at the Heidelberg Laureate Forum.

Who can quiet the animal shelter?

Single-Row Facility Layout Problem, Interactive Presentation at the Long Night of Research and at the Scratch Day.

How to behave in an interrogation?

Game Theory, Presentation at the University for Kids at the Alpen-Adria-Universität Klagenfurt.

How to behave in an interrogation and a test of courage?

Game Theory, Presentation for pupils at the Alpen-Adria-Universität Klagenfurt.

Who can quiet the school class?

Row Facility Layout Problems, Presentation at the University for Kids at the Alpen-Adria-Universität Klagenfurt.

Who can build the best city?

Quadratic Assignment Problem, Interactive Presentation at the Long Night of Research.

A Journey through the Alpen-Adria-Area.

Traveling Salesman Problem, Presentation at the University for Kids at the Alpen-Adria-Universität Klagenfurt.

Do you find the best itinerary?

Target Visitation Problem, Interactive Presentation at the Long Night of Research at the Alpen-Adria-Universität Klagenfurt.

Do you find the shortest path?

Chinese Postman Problem, Interactive Presentation at the Long Night of Research at the Alpen-Adria-Universität Klagenfurt.