Kerstin Dächert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kerstin Dächert has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Kathrin Klamroth
School of Mathematics and Natural Sciences, University of Wuppertal, Wuppertal, Germany
2 shared publications - Bhupinder Singh Saini
University of Jyväskylä
1 shared publication - Elisabeth Leoff
Department of Financial Mathematics, Fraunhofer Institute for Industrial Mathematics ITWM, Kaiserslautern, Germany
1 shared publication - Florian Schirra
Fraunhofer ITWM
1 shared publication Javier Saez-Gallego
Siemens Wind Power A/S
1 shared publication- Jonas Mahnkopp
Fraunhofer ITWM, Department of Financial Mathematics, Kaiserslautern, Germany
1 shared publication
Latest Publications
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 164371-164388
SCORE Band Visualizations: Supporting Decision Makers in Comparing High-Dimensional Outcome Vectors in Multiobjective Optimization
Clearly arranged visualizations are needed in multiobjective optimization problems with a large number of objective functions, when a large number of Pareto optimal outcome vectors (vectors of objective function values) must be compared during the decision making processes. This paper contributes to visualizing such outcome vectors independent of how they have been generated. Parallel coordinate plots are a widely used visualization technique to represent different outcome vectors. We propose a novel visualization technique called SCORE bands to be used with parallel coordinate plots to support the decision maker in simultaneously identifying patterns in outcome vectors and correlations among the objective functions in a meaningful way. To do so, amongst others, we change the ordering of objective functions and modify the distances among them in parallel coordinate plots. SCORE bands also have interactive capabilities allowing the decision maker to first study general trends among the outcome vectors as bands and then zoom-in and move about different groups of outcome vectors of interest. The novelty of our approach lies in proposing a visually appealing way to support the decision maker in dealing with large amounts of information. We demonstrate the benefits of SCORE bands with different examples.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 164371-164388
Open AccessSCORE Band Visualizations: Supporting Decision Makers in Comparing High-Dimensional Outcome Vectors in Multiobjective Optimization
Clearly arranged visualizations are needed in multiobjective optimization problems with a large number of objective functions, when a large number of Pareto optimal outcome vectors (vectors of objective function values) must be compared during the decision making processes. This paper contributes to visualizing such outcome vectors independent of how they have been generated. Parallel coordinate plots are a widely used visualization technique to represent different outcome vectors. We propose a novel visualization technique called SCORE bands to be used with parallel coordinate plots to support the decision maker in simultaneously identifying patterns in outcome vectors and correlations among the objective functions in a meaningful way. To do so, amongst others, we change the ordering of objective functions and modify the distances among them in parallel coordinate plots. SCORE bands also have interactive capabilities allowing the decision maker to first study general trends among the outcome vectors as bands and then zoom-in and move about different groups of outcome vectors of interest. The novelty of our approach lies in proposing a visually appealing way to support the decision maker in dealing with large amounts of information. We demonstrate the benefits of SCORE bands with different examples.
- Open Access
- 21 March 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (1) , 351-384
A simple, efficient and versatile objective space algorithm for multiobjective integer programming
In the last years a multitude of algorithms have been proposed to solve multiobjective integer programming problems. However, only few authors offer open-source implementations. On the other hand, new methods are typically compared to code that is publicly available, even if this code is known to be outperformed. In this paper, we aim to overcome this problem by proposing a new state-of-the-art algorithm with an open-source implementation in . The underlying method falls into the class of objective space methods, i.e., it decomposes the overall problem into a series of scalarized subproblems that can be solved with efficient single-objective IP-solvers. It keeps the number of required subproblems small by avoiding redundancies, and it can be combined with different scalarizations that all lead to comparably simple subproblems. Our algorithm bases on previous results but combines them in a new way. Numerical experiments with up to ten objectives validate that the method is efficient and that it scales well to higher dimensional problems.
- 21 March 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (1) , 351-384
Open AccessA simple, efficient and versatile objective space algorithm for multiobjective integer programming
In the last years a multitude of algorithms have been proposed to solve multiobjective integer programming problems. However, only few authors offer open-source implementations. On the other hand, new methods are typically compared to code that is publicly available, even if this code is known to be outperformed. In this paper, we aim to overcome this problem by proposing a new state-of-the-art algorithm with an open-source implementation in . The underlying method falls into the class of objective space methods, i.e., it decomposes the overall problem into a series of scalarized subproblems that can be solved with efficient single-objective IP-solvers. It keeps the number of required subproblems small by avoiding redundancies, and it can be combined with different scalarizations that all lead to comparably simple subproblems. Our algorithm bases on previous results but combines them in a new way. Numerical experiments with up to ten objectives validate that the method is efficient and that it scales well to higher dimensional problems.
- Open Access
- 9 July 2021
- Published by Springer Nature in OR Spectrum
- Vol. 44 (2) , 349-373
Multicriteria asset allocation in practice
In this paper, we consider the strategic asset allocation of an insurance company. This task can be seen as a special case of portfolio optimization. In the 1950s, Markowitz proposed to formulate portfolio optimization as a bicriteria optimization problem considering risk and return as objectives. However, recent developments in the field of insurance require four and more objectives to be considered, among them the so-called solvency ratio that stems from the Solvency II directive of the European Union issued in 2009. Moreover, the distance to the current portfolio plays an important role. While the literature on portfolio optimization with three objectives is already scarce, applications in the financial context with four and more objectives have not yet been solved so far by multi-objective approaches based on scalarizations. However, recent algorithmic improvements in the field of exact multi-objective methods allow the incorporation of many objectives and the generation of well-spread representations within few iterations. We describe the implementation of such an algorithm for a strategic asset allocation with four objective functions and demonstrate its usefulness for the practitioner. Our approach is in operative use in a German insurance company. Our partners report a significant improvement in their decision-making process since, due to the proper integration of the new objectives, the software proposes portfolios of much better quality than before within short running time.
- 9 July 2021
- Published by Springer Nature in OR Spectrum
- Vol. 44 (2) , 349-373
Open AccessMulticriteria asset allocation in practice
In this paper, we consider the strategic asset allocation of an insurance company. This task can be seen as a special case of portfolio optimization. In the 1950s, Markowitz proposed to formulate portfolio optimization as a bicriteria optimization problem considering risk and return as objectives. However, recent developments in the field of insurance require four and more objectives to be considered, among them the so-called solvency ratio that stems from the Solvency II directive of the European Union issued in 2009. Moreover, the distance to the current portfolio plays an important role. While the literature on portfolio optimization with three objectives is already scarce, applications in the financial context with four and more objectives have not yet been solved so far by multi-objective approaches based on scalarizations. However, recent algorithmic improvements in the field of exact multi-objective methods allow the incorporation of many objectives and the generation of well-spread representations within few iterations. We describe the implementation of such an algorithm for a strategic asset allocation with four objective functions and demonstrate its usefulness for the practitioner. Our approach is in operative use in a German insurance company. Our partners report a significant improvement in their decision-making process since, due to the proper integration of the new objectives, the software proposes portfolios of much better quality than before within short running time.
- 28 February 2019
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 19 (4) , 1199-1214
A Bicriteria Perspective on L-Penalty Approaches – a Corrigendum to Siddiqui and Gabriel’s L-Penalty Approach for Solving MPECs
- 28 February 2019
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 19 (4) , 1199-1214
A Bicriteria Perspective on L-Penalty Approaches – a Corrigendum to Siddiqui and Gabriel’s L-Penalty Approach for Solving MPECs