Kathrin Klamroth
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kathrin Klamroth has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Michael Stiglmayr
University of Wuppertal
16 shared publications - Luís Paquete
University of Coimbra, CISUC
12 shared publications - Carola Doerr
Sorbonne Université, CNRS, LIP6
5 shared publications - François Clément
Sorbonne Université, CNRS, LIP6, Paris, France
5 shared publications - José Rui Figueira
CEGIST, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
5 shared publications - Claudia Totzeck
University of Wuppertal
3 shared publications
Latest Publications
- Open Access
- 14 June 2026
- Published by Elsevier in SSRN Electronic Journal
Dichotomic Search for Complex Multiobjective Optimization Problems
Dichotomic search is a classical scalarization-based method for computing extreme supported nondominated points in bi-objective optimization. Its extension to more than two objectives and to continuous, numerically difficult problems is challenging due to the loss of a natural ordering of extreme supported points, the complexity of convex-hull updates, and the instability of weighted-sum solves.In this paper, we study dichotomic-search-based methods for complex multiobjective optimization problems. We review the bi-objective setting and higher-dimensional boundary dichotomic search, and propose a Continuous Boundary Dichotomic Search (CBDS) framework for continuous problems with approximate scalarization solves. The method combines boundary-first exploration, adaptive refinement of bi-objective subproblems, validity checks for dominated or inconsistent outcomes, and focused search on relevant regions of the weight set. We also introduce a Pareto knee score to identify extreme supported points with favorable trade-offs.Numerical experiments on multiobjective combinatorial problems, a radiotherapy beam intensity optimization problem, and a physics-informed neural network for a pendulum system illustrate the proposed framework. The results show that dichotomic-search-based methods can reliably identify extreme supported solutions with high Pareto knee scores with relatively few scalarization solves in low-dimensional settings, while also revealing the geometrical and computational limitations caused by the growth of convex-hull complexity in higher dimensions.
- 14 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDichotomic Search for Complex Multiobjective Optimization Problems
Dichotomic search is a classical scalarization-based method for computing extreme supported nondominated points in bi-objective optimization. Its extension to more than two objectives and to continuous, numerically difficult problems is challenging due to the loss of a natural ordering of extreme supported points, the complexity of convex-hull updates, and the instability of weighted-sum solves.In this paper, we study dichotomic-search-based methods for complex multiobjective optimization problems. We review the bi-objective setting and higher-dimensional boundary dichotomic search, and propose a Continuous Boundary Dichotomic Search (CBDS) framework for continuous problems with approximate scalarization solves. The method combines boundary-first exploration, adaptive refinement of bi-objective subproblems, validity checks for dominated or inconsistent outcomes, and focused search on relevant regions of the weight set. We also introduce a Pareto knee score to identify extreme supported points with favorable trade-offs.Numerical experiments on multiobjective combinatorial problems, a radiotherapy beam intensity optimization problem, and a physics-informed neural network for a pendulum system illustrate the proposed framework. The results show that dichotomic-search-based methods can reliably identify extreme supported solutions with high Pareto knee scores with relatively few scalarization solves in low-dimensional settings, while also revealing the geometrical and computational limitations caused by the growth of convex-hull complexity in higher dimensions.
- Open Access
- 12 June 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 194
Solving hypervolume scalarizations for MOCO problems
- 12 June 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 194
Open AccessSolving hypervolume scalarizations for MOCO problems
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 304-312
A Path-Relinking-based Heuristic for the Multiobjective Subgraph Problem
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 304-312
Open AccessA Path-Relinking-based Heuristic for the Multiobjective Subgraph Problem
- Open Access
- 27 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
- 27 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Open AccessA greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
- Open Access
- 6 May 2025
- Published by Elsevier in Operations Research Letters
- Vol. 61
On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
- 6 May 2025
- Published by Elsevier in Operations Research Letters
- Vol. 61
Open AccessOn the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
- Top Cited PapersOpen Access
- 2 May 2025
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society, Series B
- Vol. 12 (7) , 78-90
Constructing optimal star discrepancy sets
We provide in this paper a constructive proof of optimal L ∞ L_{\infty } star discrepancy values in dimension 2 for up to 21 points and up to 8 points in dimension 3. This extends work by White (Numer. Math. 27 (1976/77), no. 2, 157–164) for up to six points in dimension 2 and of Larcher and Pillichshammer (J. Comput. Appl. Math. 206 (2007), no. 2, 977–985) for two points in arbitrary dimensions. We show that these optimal sets have a far lower discrepancy than the previous references and, perhaps more importantly, present a very different structure.
- 2 May 2025
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society, Series B
- Vol. 12 (7) , 78-90
Top Cited PapersOpen AccessConstructing optimal star discrepancy sets
We provide in this paper a constructive proof of optimal L ∞ L_{\infty } star discrepancy values in dimension 2 for up to 21 points and up to 8 points in dimension 3. This extends work by White (Numer. Math. 27 (1976/77), no. 2, 157–164) for up to six points in dimension 2 and of Larcher and Pillichshammer (J. Comput. Appl. Math. 206 (2007), no. 2, 977–985) for two points in arbitrary dimensions. We show that these optimal sets have a far lower discrepancy than the previous references and, perhaps more importantly, present a very different structure.
- Open Access
- 3 April 2025
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 122 (14)
Searching permutations for constructing uniformly distributed point sets
Uniformly distributed point sets of low discrepancy are heavily used in experimental design and across a very wide range of applications such as numerical integration, computer graphics, and finance. Recent methods based on Graph Neural Networks [T. K. Rusch, N. Kirk, M. M. Bronstein, C. Lemieux, D. Rus, Proc. Natl. Acad. Sci. U.S.A. 121, e2409913121 (2024).] and solver-based optimization identified point sets having much lower discrepancy than previously known constructions. We show in this note that further substantial improvements are possible by separating the construction of low-discrepancy point sets into i) the relative position of the points, and ii) the optimal placement respecting these relationships. Using tailored permutations, we construct point sets that are of 20% smaller discrepancy on average than those proposed by Rusch et al. In terms of inverse discrepancy, our sets reduce the number of points in dimension 2 needed to obtain a discrepancy of 0.005 from more than 500 points to less than 350. For applications where the sets are used to query time-consuming models, this is a significant reduction.
- 3 April 2025
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 122 (14)
Open AccessSearching permutations for constructing uniformly distributed point sets
Uniformly distributed point sets of low discrepancy are heavily used in experimental design and across a very wide range of applications such as numerical integration, computer graphics, and finance. Recent methods based on Graph Neural Networks [T. K. Rusch, N. Kirk, M. M. Bronstein, C. Lemieux, D. Rus, Proc. Natl. Acad. Sci. U.S.A. 121, e2409913121 (2024).] and solver-based optimization identified point sets having much lower discrepancy than previously known constructions. We show in this note that further substantial improvements are possible by separating the construction of low-discrepancy point sets into i) the relative position of the points, and ii) the optimal placement respecting these relationships. Using tailored permutations, we construct point sets that are of 20% smaller discrepancy on average than those proposed by Rusch et al. In terms of inverse discrepancy, our sets reduce the number of points in dimension 2 needed to obtain a discrepancy of 0.005 from more than 500 points to less than 350. For applications where the sets are used to query time-consuming models, this is a significant reduction.
- Open Access
- 1 January 2025
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society, Series B
- Vol. 12 (7) , 78-90
Constructing optimal star discrepancy sets
We provide in this paper a constructive proof of optimal $L_{\infty }$ star discrepancy values in dimension 2 for up to 21 points and up to 8 points in dimension 3. This extends work by White (Numer. Math. 27 (1976/77), no. 2, 157–164) for up to six points in dimension 2 and of Larcher and Pillichshammer (J. Comput. Appl. Math. 206 (2007), no. 2, 977–985) for two points in arbitrary dimensions. We show that these optimal sets have a far lower discrepancy than the previous references and, perhaps more importantly, present a very different structure.- 1 January 2025
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society, Series B
- Vol. 12 (7) , 78-90
Open AccessConstructing optimal star discrepancy sets
We provide in this paper a constructive proof of optimal $L_{\infty }$ star discrepancy values in dimension 2 for up to 21 points and up to 8 points in dimension 3. This extends work by White (Numer. Math. 27 (1976/77), no. 2, 157–164) for up to six points in dimension 2 and of Larcher and Pillichshammer (J. Comput. Appl. Math. 206 (2007), no. 2, 977–985) for two points in arbitrary dimensions. We show that these optimal sets have a far lower discrepancy than the previous references and, perhaps more importantly, present a very different structure. - Open Access
- 21 December 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 323 (2) , 409-424
Solving the Multiobjective Quasi-clique Problem
- 21 December 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 323 (2) , 409-424
Open AccessSolving the Multiobjective Quasi-clique Problem
- Open Access
On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
Multi-objective unconstrained combinatorial optimization problems (MUCO) are in general hard to solve, i.e., the corresponding decision problem is NP-hard and the outcome set is intractable. In this paper we explore special cases of MUCO problems that are actually easy, i.e., solvable in polynomial time. More precisely, we show that MUCO problems with up to two ordinal objective functions plus one real-valued objective function are tractable, and that their complete nondominated set can be computed in polynomial time. For MUCO problems with one ordinal and a second ordinal or real-valued objective function we present an even more efficient algorithm that applies a greedy strategy multiple times.
Open AccessOn the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
Multi-objective unconstrained combinatorial optimization problems (MUCO) are in general hard to solve, i.e., the corresponding decision problem is NP-hard and the outcome set is intractable. In this paper we explore special cases of MUCO problems that are actually easy, i.e., solvable in polynomial time. More precisely, we show that MUCO problems with up to two ordinal objective functions plus one real-valued objective function are tractable, and that their complete nondominated set can be computed in polynomial time. For MUCO problems with one ordinal and a second ordinal or real-valued objective function we present an even more efficient algorithm that applies a greedy strategy multiple times.