MOSEK ApS, Fruebjergvej 3, Box 16 2100 Copenhagen O, Denmark

TITLE: Ten years of experience with conic quadratic optimization

ABSTRACT: For about 10 years the software package MOSEK has been capable of solving large-scale sparse conic quadratic optimization (CQO) problems. Based on the experience gained with CQO during those

10 years we will present a few important applications of conic quadratic optimization, discuss properties of the CQO problem and give an overview of how MOSEK solve a CQO problem.

We will also present numerical results demonstrating the performance of MOSEK on CQO problems and discuss future developments.

 

2. Professor Walter Gutjahr, PhD

University of Vienna, Department of Statistics and Decision Support Systems,  

Vienna, Austria

TITLE: Multi-Objective Combinatorial Optimization under Uncertainty

 ABSTRACT: In many applications of combinatorial optimization (CO), multiple objectives play a role. Frequently, in addition, uncertainty on parameters suggests the use of stochastic models. In the talk, general approaches for the solution of combined multi-objective and stochastic CO problems are discussed. Both exact and heuristic techniques will be taken into consideration. Also the theoretical analysis of solution algorithms will be addressed.

3. Professor Horst W. Hamacher, PhD

University of Kaiserslautern, Department of Mathematics, Kaiserslautern, Germany

TITLE:  Operations research methods in the planning, control, and adaptation of evacuation plans

ABSTRACT: In the planning, control, and adaptation of evacuation plans, operations research models can make valuable contributions to support decision makers both in the preparation and the actual management of evacuations. In this talk we will report on related research results of the consortium REPKA working on a project supported by the federal German research council (BMBF). The presentation will include optimization models, the sandwich approach of simulation and optimization, data collection by combined GPS and WLAN localization and the implementation of these theoretical results in actual regional evacuation project in Germany.

4. Professor Arie M.C.A. Koster - Invited Pascal2 speaker

 

 

Lehrstuhl II für Mathematik, RWTH Aachen, Nemčija

TITLE: Robust Optimization of Telecommunication Networks

ABSTRACT: Robust Optimization is an emerging field of Operations Research, focussing on dealing with data uncertainty in optimization problems. In this talk, we discuss a variety of robust optimization approaches and their application to both fixed and wireless telecommunication network design problems. In particular, we show how demand uncertainty can be incorporated in classical network design by LP duality. The robust optimization approach is evaluated with real-life Internet traffic data.

5. Professor Zrinka Lukač, PhD

University of Zagreb, Faculty of Economics & Business, Zagreb, Croatia

TITLE: Metaheuristic Optimization

ABSTRACT: Metaheuristics offer a promising approach to tackle different kinds of problems due to their ability to find acceptable solutions within a reasonable amount of computer time. This talk gives a survey of the most important metaheuristics as of today and analyzes their similarities and differences. It explores the basic concepts of intensification and diversification, the driving forces of any metaheuristic, as well as their implementation. It outlines the advantages and disadvantages of different metaheuristic approaches and gives perspectives for future development.

 

 

6.

University of Graz, Department of Statistics and Operations Research, Graz, Austria

TITLE: Mathematical Models and Solutions for Network Design Problems

ABSTRACT: We discuss two real-world scenarios of network design problems arising in the design of district heating systems and in the design of fiber optic networks. In both cases we can choose which customers to connect to the network, depending on the resulting profit, while the necessary connections incur construction costs. Maximizing the total profit minus the total cost yields the prize collecting Steiner tree problem with additional connectivity constraints. We present different mathematical solution methods, namely cut-based models, multi-commodity flow formulations and path models. The computational behavior of these models will be illustrated.

Conference language is English.