
<bib>
<comment>
This file was created by the TYPO3 extension publications
--- Timezone: CEST
Creation date: 2026-11-03
Creation time: 18:21:02
--- Number of references
253
</comment>
<reference>
<bibtype>article</bibtype>
<citeid>koenen26output</citeid>
<title>Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems</title>
<year>2026</year>
<DOI>10.1007/s10878-025-01376-2</DOI>
<journal>Journal of Combinatorial Optimization</journal>
<volume>51</volume>
<number>14</number>
<authors>
<person>
<fn>David</fn>
<sn>Könen</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>techreport</bibtype>
<citeid>lopes26solving</citeid>
<title>Solving hypervolume scalarizations for MOCO problems</title>
<year>2026</year>
<keywords>DAAD-Port2425</keywords>
<authors>
<person>
<fn>Gonçalo</fn>
<sn>Lopes</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>misc</bibtype>
<citeid>prinz2026highperformanceparallelalgorithmmultiobjective</citeid>
<title>A High-Performance Parallel Algorithm for Multi-Objective Integer Optimization</title>
<year>2026</year>
<keywords>DAAD-Port2425</keywords>
<file_url>https://arxiv.org/abs/2602.11872</file_url>
<annotation>submitted</annotation>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Prinz</sn>
</person>
<person>
<fn>Levin</fn>
<sn>Nemesch</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>misc</bibtype>
<citeid>yuden26parametric</citeid>
<title>Parametric Biobjective Linear Programming</title>
<status>2</status>
<year>2026</year>
<keywords>DAAD-Port2425</keywords>
<note>submitted to JMCDA</note>
<authors>
<person>
<fn>Kezang</fn>
<sn>Yuden</sn>
</person>
<person>
<fn>Levin</fn>
<sn>Nemesch</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>misc</bibtype>
<citeid>abel2026korovkintypetheoremsoperators</citeid>
<title>Korovkin type theorems for operators acting on functions of polynomial and exponential growth on $[0,ınfty)$</title>
<year>2026</year>
<file_url>https://arxiv.org/abs/2606.27517</file_url>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>misc</bibtype>
<citeid>abel2026commutativity-general-class</citeid>
<title>Commutativity for a general class of Bernstein-Durrmeyer operators</title>
<year>2026</year>
<note>submitted</note>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>misc</bibtype>
<citeid>abel2026commutativity-general-class</citeid>
<title>Positive linear operators fixing two prescribed functions</title>
<year>2026</year>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>abel2024asymptoticpropertiesgeneralclass</citeid>
<title>Asymptotic properties for a general class of Szász-Mirakjan-Durrmeyer operators</title>
<year>2026</year>
<DOI>10.1002/mma.70185</DOI>
<journal>Mathematical Methods in the Applied Sciences</journal>
<pages>734–743</pages>
<web_url>https://arxiv.org/abs/2407.16474</web_url>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>AAHR0</citeid>
<title>Genuine Bernstein-Durrmeyer operators preserving 1 and x^j (II)</title>
<year>2026</year>
<isbn>978-3-031-93279-3</isbn>
<DOI>10.1007/978-3-031-93279-3_4</DOI>
<booktitle>Approximation Theory and Special Functions</booktitle>
<publisher>Springer Nature Switzerland</publisher>
<pages>97--112</pages>
<event_name>ATSF 2024</event_name>
<event_place>Ankara, Turkey</event_place>
<note>submitted</note>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AAHR1</citeid>
<title>Asymptotic expansions for generalized Bernstein-Durrmeyer and genuine Bernstein-Durrmeyer operators</title>
<year>2026</year>
<DOI>10.1007/s11785-026-01929-1</DOI>
<journal>Complex Anal. Oper. Theory</journal>
<volume>20</volume>
<web_url>doi.org/10.1007/s11785-026-01929-1</web_url>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AAHR2</citeid>
<title>Kernels for composition of positive linear operators</title>
<year>2026</year>
<issn>0022-247X</issn>
<DOI>10.1016/j.jmaa.2025.130052</DOI>
<journal>Journal of Mathematical Analysis and Applications</journal>
<volume>555</volume>
<pages>130052</pages>
<number>2</number>
<web_url>http://www.sciencedirect.com/science/article/pii/S0022247X25008339</web_url>
<file_url>https:// doi.org/10.1016/j.jmaa.2025.130052</file_url>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>bauss23adapting</citeid>
<title>Adapting Branching and Queuing for Multi-objective Branch and Bound</title>
<year>2025</year>
<DOI>10.1007/978-3-031-58405-3_68</DOI>
<booktitle>Operations Research Proceedings 2023. OR 2023. Lecture Notes in Operations Research</booktitle>
<publisher>Springer, Cham</publisher>
<editor>Voigt, G., Fliedner, M., Haase, K., Brüggemann, W., Hoberg, K., Meissner, J.</editor>
<note>accepted</note>
<authors>
<person>
<fn>Julius</fn>
<sn>Bauß</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>clement25con</citeid>
<title>Constructing Optimal Star Discrepancy Sets</title>
<year>2025</year>
<DOI>10.48550/arXiv.2311.17463</DOI>
<journal>accepted in Proceedings of the AMS</journal>
<note>accepted in \textitProceedings of the AMS</note>
<authors>
<person>
<fn>François</fn>
<sn>Clément</sn>
</person>
<person>
<fn>Carola</fn>
<sn>Doerr</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>koenen25supportedness</citeid>
<title>On Supportedness in Multi‐Objective Integer Linear Programming</title>
<year>2025</year>
<month>11</month>
<issn>1099-1360</issn>
<DOI>10.1002/mcda.70024</DOI>
<journal>Journal of Multi-Criteria Decision Analysis</journal>
<volume>32</volume>
<publisher>Wiley</publisher>
<number>3</number>
<authors>
<person>
<fn>David</fn>
<sn>Könen</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>koenen25output</citeid>
<title>An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems</title>
<type>Article</type>
<year>2025</year>
<issn>0166-218X</issn>
<DOI>10.1016/j.dam.2025.06.001</DOI>
<journal>Discrete Applied Mathematics</journal>
<volume>376</volume>
<publisher>Elsevier BV</publisher>
<pages>1-14</pages>
<authors>
<person>
<fn>David</fn>
<sn>Könen</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>LOPES2025107140</citeid>
<title>A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization</title>
<abstract>The usual goal in multiobjective combinatorial optimization is to find the complete set of nondominated points. However, in general, the nondominated set may be too large to be enumerated under a tight time budget. In these cases, it is preferable to rapidly obtain a concise representation of the nondominated set that satisfies a given property of interest. This work describes a generic greedy approach to compute a representation of the nondominated set for multiobjective combinatorial optimization problems that approximately maximizes the dominated hypervolume. The representation is built iteratively by solving a sequence of hypervolume scalarized problems, each of which with respect to k reference points, which is a parameter of our approach. We present a mixed-integer formulation of the hypervolume scalarization function for k reference points as well as a combinatorial branch-and-bound for the m-objective knapsack problem. We empirically analyse the functional relationship between k and its running-time and representation quality. Our results indicate that the branch-and-bound is a much more efficient approach and that increasing k does not directly translate into much better representation quality.</abstract>
<year>2025</year>
<issn>0305-0548</issn>
<DOI>https://doi.org/10.1016/j.cor.2025.107140</DOI>
<journal>Computers & Operations Research</journal>
<volume>183</volume>
<pages>107140</pages>
<keywords>DAAD-Port2425</keywords>
<file_url>https://www.sciencedirect.com/science/article/pii/S0305054825001686</file_url>
<authors>
<person>
<fn>Gonçalo</fn>
<sn>Lopes</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>misc</bibtype>
<citeid>abel2025representationintegralkernelcomposition</citeid>
<title>A representation for the integral kernel of the composition of multivariate Bernstein-Durrmeyer operators</title>
<year>2025</year>
<file_url>https://arxiv.org/abs/2512.17297</file_url>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<title>A Space Mapping approach for the calibration of financial models with the application to the Heston model</title>
<year>2025</year>
<DOI>10.48550/arXiv.2501.14521</DOI>
<web_url>arXiv:2501.14521</web_url>
<authors>
<person>
<fn>A.</fn>
<sn>Clevenhaus</sn>
</person>
<person>
<fn>C.</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>M.</fn>
<sn>Ehrhardt</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bolt:nonc:2025</citeid>
<title>Non-convex shape optimization by dissipative Hamiltonian flows</title>
<year>2025</year>
<DOI>10.1080/0305215X.2024.2304135</DOI>
<journal>Engineering Optimization</journal>
<volume>57</volume>
<pages>384--403</pages>
<authors>
<person>
<fn>Matthias</fn>
<sn>Bolten</sn>
</person>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>doss:solv:2024</citeid>
<title>Solving the Multiobejctive Quasi-Clique Problem</title>
<year>2025</year>
<DOI>10.1016/j.ejor.2024.12.018</DOI>
<journal>European Journal of Operational Research</journal>
<volume>323</volume>
<pages>409—424</pages>
<authors>
<person>
<fn>Daniela Dos</fn>
<sn>Santos</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Pedro</fn>
<sn>Martins</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>hoff:asse:2025</citeid>
<title>Assessing the effectiveness and efficiency of selected solution approaches for two-dimensional stock cutting problems (Part III): Hybrid Approach For Printed Circuit Boards</title>
<status>3</status>
<year>2025</year>
<booktitle>AUTOMATION 2025: Conference on Automation — Innovations and Future Perspectives</booktitle>
<note>To appear</note>
<authors>
<person>
<fn>Leon</fn>
<sn>Hoffe</sn>
</person>
<person>
<fn>Berna</fn>
<sn>Ulutas</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Bracke</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>clem:sear:2025</citeid>
<title>Searching Permutations for Constructing Uniformly Distributed Point Sets</title>
<year>2025</year>
<DOI>10.1073/pnas.2424464122</DOI>
<journal>Proceedings of the National Academy of Sciences</journal>
<volume>122</volume>
<pages>e2424464122</pages>
<number>14</number>
<note>To appear</note>
<authors>
<person>
<fn>François</fn>
<sn>Clément</sn>
</person>
<person>
<fn>Carola</fn>
<sn>Doerr</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>figueira25computational</citeid>
<title>On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization</title>
<year>2025</year>
<DOI>10.1016/j.orl.2025.107302</DOI>
<journal>Operations Research Letters</journal>
<pages>107302</pages>
<authors>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Julia</fn>
<sn>Sudhoff Santos</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>loehken25multiobjective</citeid>
<title>On the multiobjective cable-trench problem</title>
<year>2025</year>
<DOI>10.1007/s10878-025-01289-0</DOI>
<journal>Journal of Combinatorial Optimization</journal>
<volume>49</volume>
<number>55</number>
<authors>
<person>
<fn>Lara</fn>
<sn>Löhken</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>abel2024cauchy</citeid>
<title>On some Cauchy problems and positive linear operators</title>
<year>2025</year>
<DOI>10.1007/s00009-024-02778-y</DOI>
<journal>Mediterranean Journal of Mathematics</journal>
<volume>22</volume>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>gaul25tight</citeid>
<title>A Tight Formulation for the Dial-a-Ride Problem</title>
<year>2025</year>
<issn>0377-2217</issn>
<DOI>10.1016/j.ejor.2024.09.028</DOI>
<journal>European Journal of Operational Research</journal>
<volume>321</volume>
<pages>363-382</pages>
<number>2</number>
<keywords>Optimization and Control (math.OC), Discrete Mathematics (cs.DM), FOS: Mathematics, FOS: Mathematics, FOS: Computer and information sciences, FOS: Computer and information sciences</keywords>
<authors>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Christian</fn>
<sn>Pfeiffer</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Arne</fn>
<sn>Schulz</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>bauss24improvements</citeid>
<title>On improvements of multi-objective branch and bound</title>
<abstract>Branch and bound methods which are based on the principle “divide and conquer” are a well established solution approach in single-objective integer programming. In multi-objective optimization, branch and bound algorithms are increasingly attracting interest. However, the larger number of objectives raises additional difficulties for implicit enumeration approaches like branch and bound. Since bounding and pruning is considerably weaker in multiple objectives, many branches have to be (partially) searched and may not be pruned directly. The adaptive use of objective space information can guide the search in promising directions to determine a good approximation of the Pareto front already in early stages of the algorithm. In particular, we focus in this article on improving the branching and queuing of subproblems and the handling of lower bound sets. In our numerical tests, we evaluate the impact of the proposed methods in comparison to a standard implementation of multi-objective branch and bound on knapsack problems, generalized assignment problems and (un)capacitated facility location problems.</abstract>
<type>Dissertation</type>
<year>2024</year>
<issn>2192-4406</issn>
<DOI>10.25926/BUW/0-258</DOI>
<school>Bergische Universität Wuppertal</school>
<journal>EURO Journal on Computational Optimization</journal>
<volume>12</volume>
<publisher>Bergische Universität Wuppertal</publisher>
<pages>100099</pages>
<tags>DFG-higher</tags>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhs/download/pdf/7525852</file_url>
<authors>
<person>
<fn>Julius</fn>
<sn>Bauß</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>gaul24exact</citeid>
<title>Exact and Heuristic Methods for Dial-a-Ride Problems</title>
<type>Dissertation</type>
<year>2024</year>
<DOI>10.25926/BUW/0-303</DOI>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhs/download/pdf/7539417</file_url>
<authors>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>schultes24multiobjective</citeid>
<title>Multiobjective optimization of shapes using scalarization techniques</title>
<type>Dissertation</type>
<year>2024</year>
<DOI>10.25926/BUW/0-445</DOI>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhs/download/pdf/7594392</file_url>
<authors>
<person>
<fn>Johanna</fn>
<sn>Schultes</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>stiglmayr24determining</citeid>
<title>Determining Cost-Efficient Controls of Electrical Energy Storages Using Dynamic Programming</title>
<year>2024</year>
<DOI>10.1186/s13362-024-00140-1</DOI>
<journal>Journal of Mathematics in Industry</journal>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Svenja</fn>
<sn>Uhlemeyer</sn>
</person>
<person>
<fn>Björn</fn>
<sn>Uhlemeyer</sn>
</person>
<person>
<fn>Markus</fn>
<sn>Zdrallek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>techreport</bibtype>
<citeid>Santos24b</citeid>
<title>Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems</title>
<year>2024</year>
<DOI>10.48550/arXiv.2403.08534</DOI>
<school>arXiv</school>
<authors>
<person>
<fn>Daniela Scherer</fn>
<sn>Santos</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Pedro</fn>
<sn>Martins</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Bailo2024</citeid>
<title>CBX: Python and Julia Packages for Consensus-Based Interacting Particle Methods</title>
<year>2024</year>
<DOI>10.21105/joss.06611</DOI>
<journal>Journal of Open Source Software</journal>
<volume>9</volume>
<publisher>The Open Journal</publisher>
<pages>6611</pages>
<number>98</number>
<file_url>https://doi.org/10.21105/joss.06611</file_url>
<authors>
<person>
<fn>Rafael</fn>
<sn>Bailo</sn>
</person>
<person>
<fn>Alethea</fn>
<sn>Barbaro</sn>
</person>
<person>
<fn>Susana N.</fn>
<sn>Gomes</sn>
</person>
<person>
<fn>Konstantin</fn>
<sn>Riedl</sn>
</person>
<person>
<fn>Tim</fn>
<sn>Roith</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Urbain</fn>
<sn>Vaes</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>allmendinger24multiobjective</citeid>
<title>Multiobjective Optimization on a Budget (Dagstuhl Seminar 23361)</title>
<year>2024</year>
<DOI>10.4230/DAGREP.13.9.1</DOI>
<publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</publisher>
<keywords>evolutionary algorithms, expensive optimization, few-shot learning, machine learning, optimization, simulation, Computing methodologies → Machine learning, Computing methodologies → Neural networks, Mathematics of computing → Evolutionary algorithms, Theory of computation → Mathematical optimization, Computing methodologies → Computational control theory</keywords>
<authors>
<person>
<fn>Richard</fn>
<sn>Allmendinger</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
<person>
<fn>Serpil</fn>
<sn>Sayin</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>andersen24sensitivity</citeid>
<title>Sensitivity Analysis of the Cost Coefficients in Multiobjective Integer Linear Optimization</title>
<year>2024</year>
<DOI>10.1287/mnsc.2021.01406</DOI>
<journal>Management Science</journal>
<authors>
<person>
<fn>Kim Allan</fn>
<sn>Andersen</sn>
</person>
<person>
<fn>Trine Krogh</fn>
<sn>Boomsma</sn>
</person>
<person>
<fn>Britta</fn>
<sn>Efkes</sn>
</person>
<person>
<fn>Nicolas</fn>
<sn>Forget</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bauss24augmenting</citeid>
<title>Augmenting Biobjective Branch & Bound with Scalarization-Based Information</title>
<year>2024</year>
<DOI>10.1007/s00186-024-00854-3</DOI>
<journal>Mathematical Methods of Operations Research</journal>
<keywords>Optimization and Control (math.OC), FOS: Mathematics</keywords>
<tags>DFG-higher</tags>
<authors>
<person>
<fn>Julius</fn>
<sn>Bauß</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>PHS-IPS</citeid>
<title>Port-Hamiltonian Structure of Interacting Particle Systems and Its Mean-Field Limit</title>
<year>2024</year>
<DOI>10.48550/arXiv.2301.06121</DOI>
<journal>SIAM Multiscale Modelling & Simulation</journal>
<volume>22</volume>
<note>arXiv:2301.06121</note>
<authors>
<person>
<fn>B.</fn>
<sn>Jacob</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>MO-CBO</citeid>
<title>Consensus-Based Optimization for Multi-Objective Problems: A Multi-Swarm Approach</title>
<year>2024</year>
<DOI>10.1007/s10898-024-01369-1</DOI>
<journal>Journal of Global Optimization</journal>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>daec:asim:2024</citeid>
<title>A simple,  efficient and versatile objective space algorithm for multiobjective integer programming</title>
<year>2024</year>
<DOI>10.1007/s00186-023-00841-0</DOI>
<journal>Mathematical Methods of Operations Research</journal>
<volume>100</volume>
<pages>351—384</pages>
<tags>DFG-higher</tags>
<note>accepted</note>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Tino</fn>
<sn>Fleuren</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Abelasymptotic2024</citeid>
<title>Asymptotic expansions for variants of the gamma and Post–Widder operators preserving 1 and x^j</title>
<year>2024</year>
<DOI>10.1002/mma.10217</DOI>
<journal>Mathematical Methods in the Applied Sciences</journal>
<volume>47</volume>
<pages>13718-13733</pages>
<number>18</number>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Acuvoronovskajal2024</citeid>
<title>Voronovskaja type results for the Aldaz-Kounchev-Render versions of generalized Baskakov operators</title>
<year>2024</year>
<DOI>10.2298/AADM230725016A</DOI>
<journal>Applicable Analysis and Discrete Mathematics</journal>
<pages>1-16</pages>
<number>00</number>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
<person>
<fn>Ancuta Emilia</fn>
<sn>Steopoaie</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Guenther2024</citeid>
<title>Data-driven adjoint-based calibration of port-Hamiltonian systems in time domain</title>
<year>2024</year>
<DOI>https://doi.org/10.1007/s00498-024-00389-2</DOI>
<journal>Math. Control Signals Syst.</journal>
<volume>36</volume>
<pages>957–977</pages>
<authors>
<person>
<fn>M.</fn>
<sn>Günther</sn>
</person>
<person>
<fn>B.</fn>
<sn>Jacob</sn>
</person>
<person>
<fn>C.</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>sain:scor:2024</citeid>
<title>SCORE Band Visualizations: Supporting Decision Makers in Comparing High-Dimensional Outcome Vectors in Multiobjective Optimization</title>
<year>2024</year>
<DOI>10.1109/access.2024.3491423</DOI>
<journal>IEEE Access</journal>
<volume>12</volume>
<pages>164371—164388</pages>
<authors>
<person>
<fn>B. S.</fn>
<sn>Saini</sn>
</person>
<person>
<fn>K.</fn>
<sn>Miettinen</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>R. E.</fn>
<sn>Steuer</sn>
</person>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>abel2024commutativityspectralpropertiesgeneral</citeid>
<title>Commutativity and spectral properties for a general class of Szász-Mirakjan-Durrmeyer operators</title>
<year>2024</year>
<DOI>10.1007/s43036-024-00403-z</DOI>
<journal>Advances in Operator Theory</journal>
<volume>10</volume>
<pages>14</pages>
<number>1</number>
<file_url>https://arxiv.org/abs/2407.21722</file_url>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>antunes24special</citeid>
<title>Special issue on exact and approximation methods for mixed-integer multi-objective optimization</title>
<year>2024</year>
<month>8</month>
<issn>1432-5217</issn>
<DOI>10.1007/s00186-024-00874-z</DOI>
<journal>Mathematical Methods of Operations Research</journal>
<publisher>Springer Science and Business Media LLC</publisher>
<authors>
<person>
<fn>Carlos Henggeler</fn>
<sn>Antunes</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>reiter_et_al:OASIcs.ATMOS.2024.14</citeid>
<title>The Line-Based Dial-a-Ride Problem</title>
<year>2024</year>
<DOI>10.4230/OASIcs.ATMOS.2024.14</DOI>
<booktitle>24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)</booktitle>
<volume>123</volume>
<publisher>Schloss Dagstuhl — Leibniz-Zentrum für Informatik</publisher>
<address>Dagstuhl, Germany</address>
<series>Open Access Series in Informatics (OASIcs)</series>
<editor>Bouman, Paul C. and Kontogiannis, Spyros C.</editor>
<pages>14:1—14:20</pages>
<event_name>24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs)</event_name>
<authors>
<person>
<fn>Kendra</fn>
<sn>Reiter</sn>
</person>
<person>
<fn>Marie</fn>
<sn>Schmidt</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>abel23genuine</citeid>
<title>Genuine Bernstein–Durrmeyer type operators preserving 1 and $x^j$</title>
<year>2023</year>
<month>10</month>
<issn>2008-8752</issn>
<DOI>10.1007/s43034-023-00305-w</DOI>
<journal>Annals of Functional Analysis</journal>
<volume>15</volume>
<publisher>Springer Science and Business Media LLC</publisher>
<number>1</number>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>abel23voronovskaja</citeid>
<title>Voronovskaja formula for Aldaz–Kounchev–Render operators: uniform convergence</title>
<year>2023</year>
<month>12</month>
<issn>1664-235X</issn>
<DOI>10.1007/s13324-023-00861-3</DOI>
<journal>Analysis and Mathematical Physics</journal>
<volume>14</volume>
<number>1</number>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>abel23positive</citeid>
<title>Positive linear operators preserving certain monomials on [0, ∞)</title>
<status>1</status>
<year>2023</year>
<issn>2035-6803</issn>
<DOI>10.14658/PUPJ-DRNA-2023-3-2</DOI>
<journal>Dolomites Research Notes on Approximation</journal>
<volume>16</volume>
<pages>1-9</pages>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>kraus2023online</citeid>
<title>On the online path extension problem -- Location and routing problems in board games</title>
<year>2023</year>
<DOI>10.48550/arXiv.2305.12898</DOI>
<authors>
<person>
<fn>Konstantin</fn>
<sn>Kraus</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>held:pinn:2023</citeid>
<title>PINN training using biobjective optimization: The trade-off between data loss and residual loss</title>
<year>2023</year>
<DOI>10.1016/j.jcp.2023.112211</DOI>
<journal>Journal of Computational Physics</journal>
<volume>488</volume>
<pages>112211</pages>
<keywords>Physics-informed neural networks, Compartment models, Loss function, Multiobjective optimization, Weighting parameters, Pareto front</keywords>
<authors>
<person>
<fn>Fabian</fn>
<sn>Heldmann</sn>
</person>
<person>
<fn>Sarah</fn>
<sn>Berkhahn</sn>
</person>
<person>
<fn>Matthias</fn>
<sn>Ehrhardt</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>KLAMROTH2023427</citeid>
<title>Ordinal optimization through multi-objective reformulation</title>
<year>2023</year>
<issn>0377-2217</issn>
<DOI>https://doi.org/10.1016/j.ejor.2023.04.042</DOI>
<journal>European Journal of Operational Research</journal>
<volume>311</volume>
<pages>427-443</pages>
<number>2</number>
<keywords>Optimization and Control (math.OC), Combinatorics (math.CO), FOS: Mathematics, FOS: Mathematics</keywords>
<tags>DFG-higher</tags>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Julia</fn>
<sn>Sudhoff</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klamroth23efficient</citeid>
<title>Efficient Dominance Filtering for Unions and Minkowski Sums of Non-Dominated Sets</title>
<year>2023</year>
<DOI>10.1016/j.cor.2023.106506</DOI>
<journal>Computers and Operations Research</journal>
<publisher>Elsevier {BV}</publisher>
<file_url>https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4308273</file_url>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Bruno</fn>
<sn>Lang</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>CBO-EKI</citeid>
<title>Consensus-based Optimization and Ensemble Kalman Inversion for Global Optimization Problems with Constraints</title>
<year>2023</year>
<DOI>10.48550/arXiv.2111.02970</DOI>
<booktitle>Modeling and Simulation for Collective Dynamics,Lecture Notes Series, Institute for Mathematical Sciences, NUS</booktitle>
<volume>40</volume>
<authors>
<person>
<fn>Jose Antonio</fn>
<sn>Carrillo</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Urbain</fn>
<sn>Vaes</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>SCEE2022</citeid>
<title>Structure-preserving identification of port-Hamiltonian systems - a sensitivity-based approach</title>
<year>2023</year>
<DOI>10.48550/arXiv.2301.02019</DOI>
<note>arXiv:2301.02019</note>
<authors>
<person>
<fn>Michael</fn>
<sn>Günther</sn>
</person>
<person>
<fn>Birgit</fn>
<sn>Jacob</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Asatryan2023</citeid>
<title>Ridepooling and public bus services: A comparative case-study</title>
<year>2023</year>
<DOI>10.48550/ARXIV.2302.01709</DOI>
<journal>Submitted to Transportation</journal>
<publisher>arXiv</publisher>
<keywords>Discrete Mathematics (cs.DM), Systems and Control (eess.SY), FOS: Computer and information sciences, FOS: Computer and information sciences, FOS: Electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering</keywords>
<authors>
<person>
<fn>Hayk</fn>
<sn>Asatryan</sn>
</person>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inbook</bibtype>
<citeid>gueklafon23</citeid>
<title>Theoretical aspects of subset selection in multi-objective optimization</title>
<year>2023</year>
<DOI>10.1007/978-3-031-25263-1_8</DOI>
<booktitle>Many-Criteria Optimization and Decision Analysis</booktitle>
<publisher>Springer</publisher>
<series>Natural Computing Series</series>
<editor>Brockhoff, D. and Emmerich, M. and Naujoks, B. and Purshouse, R.</editor>
<pages>213--239</pages>
<authors>
<person>
<fn>Andreia P.</fn>
<sn>Guerreiro</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<title>Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems</title>
<year>2023</year>
<DOI>10.48550/arXiv.2303.15082</DOI>
<authors>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Bruno</fn>
<sn>Lang</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>acu_heilmann_rasa_2023</citeid>
<title>Some results for the inverse of a Bernstein–Schnabl type operator</title>
<year>2023</year>
<DOI>10.1007/s13324-022-00777-4</DOI>
<journal>Analysis and Mathematical Physics</journal>
<volume>13</volume>
<number>1</number>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>acu_heilmann_rasa</citeid>
<title>Convergence of linking Durrmeyer type modifications of generalized Baskakov operators</title>
<year>2023</year>
<DOI>10.1007/s40840-023-01503-4</DOI>
<journal>Bulletin of the Malaysian Math. Sciences Society</journal>
<volume>46</volume>
<number>3</number>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
<person>
<fn>Andra</fn>
<sn>Seserman</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>acu2022poisson</citeid>
<title>Poisson approximation to the binomial distribution: extensions to the convergence of positive operators</title>
<year>2023</year>
<DOI>0.1007/s13398-023-01497-5</DOI>
<journal>Rev. Real Acad. Cienc. Exactas Fis. Nat. Ser. A-Mat.</journal>
<volume>117</volume>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
<person>
<fn>Andra</fn>
<sn>Seserman</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Klamroth2023Multi</citeid>
<title>Multi-objective matroid optimization with ordinal weights</title>
<year>2023</year>
<issn>0166-218X</issn>
<DOI>10.1016/j.dam.2022.07.017</DOI>
<journal>Discrete Applied Mathematics</journal>
<volume>335</volume>
<pages>104-119</pages>
<tags>DFG-higher</tags>
<note>Emerging Applications, Models and Algorithms in Combinatorial Optimization</note>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Julia</fn>
<sn>Sudhoff</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Gorski2023Biobjective</citeid>
<title>Biobjective optimization problems on matroids with binary costs</title>
<year>2023</year>
<DOI>10.1080/02331934.2022.2044479</DOI>
<journal>Optimization</journal>
<volume>72</volume>
<publisher>Taylor & Francis</publisher>
<pages>1931-1960</pages>
<number>7</number>
<authors>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Julia</fn>
<sn>Sudhoff</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GA-CBO</citeid>
<title>Kinetic based optimization enhanced by genetic dynamics</title>
<year>2023</year>
<DOI>10.48550/arXiv.2306.09199</DOI>
<authors>
<person>
<fn>Giacomo</fn>
<sn>Albi</sn>
</person>
<person>
<fn>Federica</fn>
<sn>Ferrarese</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bauss23adaptive</citeid>
<title>Adaptive Improvements of Multi-objective Branch and Bound</title>
<type>Article</type>
<year>2023</year>
<DOI>10.48550/arXiv.2312.12192</DOI>
<authors>
<person>
<fn>Julius</fn>
<sn>Bauß</sn>
</person>
<person>
<fn>Sophie N.</fn>
<sn>Parragh</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>kordon23principled</citeid>
<title>A principled representation of elongated structures using heatmaps</title>
<year>2023</year>
<month>9</month>
<DOI>10.1038/s41598-023-41221-2</DOI>
<journal>Scientific Reports</journal>
<volume>13</volume>
<number>15253</number>
<file_url>https://www.nature.com/articles/s41598-023-41221-2.pdf</file_url>
<authors>
<person>
<fn>Florian</fn>
<sn>Kordon</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Andreas</fn>
<sn>Maier</sn>
</person>
<person>
<fn>Celia Mart{\'{\i}}n</fn>
<sn>Vicario</sn>
</person>
<person>
<fn>Tobias</fn>
<sn>Pertlwieser</sn>
</person>
<person>
<fn>Holger</fn>
<sn>Kunze</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>gaul21event</citeid>
<title>Event-based MILP models for ridepooling applications</title>
<year>2022</year>
<DOI>10.1016/j.ejor.2021.11.053</DOI>
<journal>European Journal of Operational Research</journal>
<edition>3</edition>
<volume>301</volume>
<pages>1048-1063</pages>
<authors>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>paquete21computing</citeid>
<title>Computing Representations using Hypervolume Scalarizations</title>
<year>2022</year>
<DOI>10.1016/j.cor.2021.105349</DOI>
<journal>Computers and Operations Research</journal>
<volume>137</volume>
<pages>105349</pages>
<authors>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Ana Catarina</fn>
<sn>Lourenço</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>sudhoff22ordinal</citeid>
<title>Ordinal costs in multi-objective combinatorial optimization</title>
<type>Dissertation</type>
<year>2022</year>
<DOI>10.25926/BUW/0-50</DOI>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhs/download/pdf/7085087</file_url>
<authors>
<person>
<fn>Julia</fn>
<sn>Sudhoff</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<title>Branch-and-bound and objective branching with three or more objectives</title>
<abstract>The recent success of bi-objective Branch-and-Bound (B&B) algorithms heavily relies on the efficient computation of upper and lower bound sets. These bound sets are used as a supplement to the classical dominance test to improve the computational time by imposing inequalities derived from (partial) dominance in the objective space. This process is called objective branching since it is mostly applied when generating child nodes. In this paper, we extend the concept of objective branching to multi-objective integer optimization problems with three or more objective functions. Several difficulties arise in this case, as there is no longer a lexicographic order among non-dominated outcome vectors when there are three or more objectives. We discuss the general concept of objective branching in any number of dimensions and suggest a merging operation of local upper bounds to avoid the generation of redundant sub-problems. Finally, results from extensive experimental studies on several classes of multi-objective optimization problems is reported.</abstract>
<year>2022</year>
<issn>0305-0548</issn>
<DOI>10.1016/j.cor.2022.106012</DOI>
<journal>Computers & Operations Research</journal>
<edition>148</edition>
<volume>148</volume>
<keywords>Multi-objective combinatorial optimization, Multi-objective integer programming, Branch & bound, Objective branching, Bound sets</keywords>
<authors>
<person>
<fn>Nicolas</fn>
<sn>Forget</sn>
</person>
<person>
<fn>Sune Lauth</fn>
<sn>Gadegaard</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Lars Relund</fn>
<sn>Nielsen</sn>
</person>
<person>
<fn>Anthony</fn>
<sn>Przybylski</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>KONEN2022333</citeid>
<title>Finding all minimum cost flows and a faster algorithm for the K best flow problem</title>
<abstract>This paper addresses the problem of determining all optimal integer solutions of a linear integer network flow problem, which we call the all optimal integer flow (AOF) problem. We derive an O(F(m+n)+mn+M) time algorithm to determine all F many optimal integer flows in a directed network with n nodes and m arcs, where M is the best time needed to find one minimum cost flow. We remark that stopping Hamacher’s well-known method for the determination of the K best integer flows (Hamacher, 1995) at the first sub-optimal flow results in an algorithm with a running time of O(Fm(nlogn+m)+M) for solving the AOF problem. Our improvement is essentially made possible by replacing the shortest path sub-problem with a more efficient way to determine a so-called proper zero cost cycle using a modified depth-first search technique. As a byproduct, our analysis yields an enhanced algorithm to determine the K best integer flows that runs in O(Kn3+M). Besides, we give lower and upper bounds for the number of all optimal integer and feasible integer solutions. Our bounds are based on the fact that any optimal solution can be obtained by an initial optimal tree solution plus a conical combination of incidence vectors of all induced cycles with bounded coefficients.</abstract>
<year>2022</year>
<issn>0166-218X</issn>
<DOI>10.1016/j.dam.2022.07.007</DOI>
<journal>Discrete Applied Mathematics</journal>
<volume>321</volume>
<pages>333-349</pages>
<keywords>Minimum cost flow, K best network flow, Integer network flow algorithm, All optimal solutions, Combinatorial optimization</keywords>
<authors>
<person>
<fn>David</fn>
<sn>Könen</sn>
</person>
<person>
<fn>Daniel</fn>
<sn>Schmidt</sn>
</person>
<person>
<fn>Christiane</fn>
<sn>Spisla</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>PAMM_2022</citeid>
<title>Modeling Minimum Cost Network Flows With Port-Hamiltonian Systems</title>
<year>2022</year>
<DOI>10.48550/arXiv.2303.13196</DOI>
<journal>PAMM</journal>
<publisher>Wiley</publisher>
<authors>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Bruno</fn>
<sn>Lang</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>PHS-pedestrians</citeid>
<title>Multi-scale description of pedestrian collective dynamics with port-Hamiltonian systems</title>
<year>2022</year>
<DOI>10.48550/arXiv.2211.06503</DOI>
<note>arXiv:2211.06503</note>
<authors>
<person>
<fn>Antoine</fn>
<sn>Tordeux</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>InfGradCBO</citeid>
<title>Ensemble-based gradient inference for particle methods in optimization and sampling</title>
<year>2022</year>
<DOI>10.48550/arXiv.2209.15420</DOI>
<note>arXiv:2209.15420</note>
<authors>
<person>
<fn>Claudia</fn>
<sn>Schillings</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Philipp</fn>
<sn>Wacker</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AcuHR2021</citeid>
<title>Voronovskaya type results for special sequences of operators</title>
<year>2022</year>
<DOI>10.1007/s13398-021-01157-6</DOI>
<journal>RACSAM</journal>
<volume>116,19</volume>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Madalina</fn>
<sn>Dancs</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
<person>
<fn>Vlad</fn>
<sn>Paşca</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<title>A Bernstein-Schnabl type operator</title>
<year>2022</year>
<DOI>10.2298/AADM210714011A</DOI>
<journal>Applicable Analysis and Discrete Mathematics</journal>
<volume>16(2)</volume>
<pages>495-507</pages>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Madalina</fn>
<sn>Dancs</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
<person>
<fn>Vlad</fn>
<sn>Paşca</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>stiglmayr22decision</citeid>
<title>Decision Space Robustness for Multiobjective Integer Linear Programming</title>
<year>2022</year>
<DOI>10.1007/s10479-021-04462-w</DOI>
<journal>Annals of Operations Research</journal>
<volume>319</volume>
<pages>1769--1791</pages>
<file_url>https://www.imacm.uni-wuppertal.de/fileadmin/imacm/preprints/2020/imacm_20_37.pdf</file_url>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>reiners22efficient</citeid>
<title>Efficient and sparse neural networks by pruning weights in a multiobjective learning approach</title>
<year>2022</year>
<DOI>10.1016/j.cor.2021.105676</DOI>
<journal>Computers & Operations Research</journal>
<edition>141</edition>
<pages>105676</pages>
<authors>
<person>
<fn>Malena</fn>
<sn>Reiners</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Fabian</fn>
<sn>Heldmann</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bolten22tracing</citeid>
<title>Tracing locally Pareto optimal points by numerical integration</title>
<year>2022</year>
<DOI>10.1137/20M1341106</DOI>
<journal>SIAM Journal on Control and Optimization</journal>
<volume>59</volume>
<pages>3302-3328</pages>
<number>5</number>
<authors>
<person>
<fn>Matthias</fn>
<sn>Bolten</sn>
</person>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>halffmann22MOILPsurvey</citeid>
<title>Exact algorithms for multiobjective linear optimization problems with integer variables - a state of the art survey</title>
<year>2022</year>
<DOI>10.1002/mcda.1780</DOI>
<journal>Journal of Multicriteria Decision Analysis</journal>
<volume>29</volume>
<pages>343–363</pages>
<authors>
<person>
<fn>Pascal</fn>
<sn>Halffmann</sn>
</person>
<person>
<fn>Luca E.</fn>
<sn>Schäfer</sn>
</person>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>doganay21biobjective</citeid>
<title>Biobjective shape optimization algorithms enhanced by derivative information</title>
<type>Dissertation</type>
<year>2021</year>
<DOI>10.25926/pfta-7236</DOI>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhsmig/download/pdf/6249554</file_url>
<authors>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schnepper20local</citeid>
<title>A Local Analysis to Determine All Optimal Solutions of p-k-max Location Problems on Networks
</title>
<year>2021</year>
<DOI>10.1016/j.dam.2020.05.013</DOI>
<journal>Discrete Applied Mathematics</journal>
<volume>296</volume>
<pages>217-234</pages>
<authors>
<person>
<fn>Teresa</fn>
<sn>Schnepper</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Justo</fn>
<sn>Puerto</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>backhaus20mathematical</citeid>
<title>GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks</title>
<year>2021</year>
<DOI>10.1007/978-3-030-62732-4_4</DOI>
<booktitle>Mathematical MSO for Power Engineering and Management</booktitle>
<publisher>Springer Berlin/Heidelberg</publisher>
<series>Mathematics in Industry</series>
<editor>S. Goettlich, M. Herty and A. Milde</editor>
<authors>
<person>
<fn>J.</fn>
<sn>Backhaus</sn>
</person>
<person>
<fn>M.</fn>
<sn>Bolten</sn>
</person>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>M.</fn>
<sn>Ehrhardt</sn>
</person>
<person>
<fn>B.</fn>
<sn>Engel</sn>
</person>
<person>
<fn>C.</fn>
<sn>Frey</sn>
</person>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>M.</fn>
<sn>Günther</sn>
</person>
<person>
<fn>C.</fn>
<sn>Hahn</sn>
</person>
<person>
<fn>J.</fn>
<sn>Jäschcke</sn>
</person>
<person>
<fn>P.</fn>
<sn>Jaksch</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>A.</fn>
<sn>Liefke</sn>
</person>
<person>
<fn>D.</fn>
<sn>Luft</sn>
</person>
<person>
<fn>L.</fn>
<sn>Mäde</sn>
</person>
<person>
<fn>V.</fn>
<sn>Marciniak</sn>
</person>
<person>
<fn>M.</fn>
<sn>Reese</sn>
</person>
<person>
<fn>J.</fn>
<sn>Schultes</sn>
</person>
<person>
<fn>V.</fn>
<sn>Schulz</sn>
</person>
<person>
<fn>S.</fn>
<sn>Schmitz</sn>
</person>
<person>
<fn>J.</fn>
<sn>Steiner</sn>
</person>
<person>
<fn>M.</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AcuHR2020</citeid>
<title>Iterates of convolution-type operators</title>
<year>2021</year>
<DOI>10.1007/s11117-020-00773-7</DOI>
<journal>Positivity</journal>
<volume>25</volume>
<pages>495-506</pages>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>BurgerPTT2021</citeid>
<title>Mean-field optimal control and optimality conditions in the space of probability measures</title>
<year>2021</year>
<DOI>10.48550/arXiv.1902.05339</DOI>
<journal>SIAM Journal of Control and Optimization</journal>
<volume>59</volume>
<pages>977-1006</pages>
<number>2</number>
<authors>
<person>
<fn>Martin</fn>
<sn>Burger</sn>
</person>
<person>
<fn>Rene</fn>
<sn>Pinnau</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Oliver</fn>
<sn>Tse</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>gaul21solving</citeid>
<title>Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph</title>
<year>2021</year>
<DOI>10.4230/OASIcs.ATMOS.2021.8</DOI>
<booktitle>21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)</booktitle>
<volume>96</volume>
<publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher>
<series>Open Access Series in Informatics (OASIcs)</series>
<editor>M. Müller-Hannemann and F. Perea</editor>
<pages>8:1-8:16</pages>
<number>8</number>
<authors>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<title>Eigenstructure and iterates for uniquely ergodic Kantorovich modifications of operators II</title>
<year>2021</year>
<DOI>10.1007/s11117-021-00832-7</DOI>
<journal>Positivity</journal>
<volume>25</volume>
<pages>1585-1599</pages>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>556982785278_2021</citeid>
<title>Remarks on a Bernstein-type operator of Aldaz, Kounchev and Render</title>
<status>2</status>
<year>2021</year>
<DOI>10.48550/arXiv.2108.07889</DOI>
<journal>J. Numer. Anal. Approx. Theory</journal>
<volume>50</volume>
<pages>3-11</pages>
<number>1</number>
<file_url>https://ictp.acad.ro/jnaat/journal/article/view/1237</file_url>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<title>Mean-field optimal control for biological pattern formation</title>
<year>2021</year>
<DOI>10.48550/arXiv.2009.09894</DOI>
<journal>ESAIM COCV</journal>
<volume>27</volume>
<number>40</number>
<authors>
<person>
<fn>Martin</fn>
<sn>Burger</sn>
</person>
<person>
<fn>Lisa Maria</fn>
<sn>Kreusser</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>stiglmayr21projekt</citeid>
<title>Projekt Ride-Hailing Wuppertal</title>
<year>2021</year>
<booktitle>Erfolgsformeln - Anwendungen der Mathematik</booktitle>
<editor>Matthias Ehrhardt and Michael G</editor>
<web_url>https://erfolgsformeln.uni-wuppertal.de/</web_url>
<file_url>https://erfolgsformeln.uni-wuppertal.de/fileadmin/mathe/erfolgsformeln/Erfolgsformeln.pdf</file_url>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GottlichT2021</citeid>
<title>Parameter calibration with stochastic gradient descent for interacting particle systems driven by neural networks</title>
<year>2021</year>
<DOI>10.1007/s00498-021-00309-8</DOI>
<journal>Mathematics of Control, Signals, and Systems</journal>
<volume>34</volume>
<pages>185-214</pages>
<authors>
<person>
<fn>Simone</fn>
<sn>Goettlich</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>WeissenGT2021</citeid>
<title>Space mapping-based optimization with the macroscopic limit of interacting particle systems</title>
<year>2021</year>
<DOI>10.1007/s11081-021-09686-0</DOI>
<journal>Optimization and Engineering</journal>
<volume>online</volume>
<authors>
<person>
<fn>Jennifer</fn>
<sn>Weissen</sn>
</person>
<person>
<fn>Simone</fn>
<sn>Goettlich</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>eichfelder21bandb</citeid>
<title>Nonconvex constrained optimization by a filtering branch and bound</title>
<year>2021</year>
<DOI>10.1007/s10898-020-00956-2</DOI>
<journal>Journal of Global Optimization</journal>
<volume>80</volume>
<pages>31-61</pages>
<authors>
<person>
<fn>Gabriele</fn>
<sn>Eichfelder</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Julia</fn>
<sn>Niebling</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schultes21hypervolume</citeid>
<title>Hypervolume Scalarization for Shape Optimization to Improve Reliability and Cost of Ceramic Components</title>
<year>2021</year>
<DOI>10.1007/s11081-020-09586-9</DOI>
<journal>Optimization and Engineering</journal>
<volume>22</volume>
<pages>1203-1231</pages>
<number>2</number>
<authors>
<person>
<fn>Johanna</fn>
<sn>Schultes</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Camilla</fn>
<sn>Hahn</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GAUL2021188</citeid>
<title>Chvátal-Gomory cuts for the Steiner tree problem</title>
<year>2021</year>
<issn>0166-218X</issn>
<DOI>10.1016/j.dam.2020.12.016</DOI>
<journal>Discrete Applied Mathematics</journal>
<volume>291</volume>
<pages>188-200</pages>
<authors>
<person>
<fn>Daniela</fn>
<sn>Gaul</sn>
</person>
<person>
<fn>Daniel R.</fn>
<sn>Schmidt</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AbelHK2019</citeid>
<title>Convergence of linking Baskakov-type operators</title>
<year>2020</year>
<DOI>10.1007/s10998-020-00337-y</DOI>
<journal>Periodica Mathematica Hungarica</journal>
<volume>80</volume>
<pages>280-288</pages>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Vitaliy</fn>
<sn>Kushnirevych</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>BerdyshevaHH2019</citeid>
<title>Pointwise convergence of the Bernstein-Durrmeyer
operator with respect to a collection of measures</title>
<year>2020</year>
<DOI>10.1016/j.jat.2019.105339</DOI>
<journal>Journal of Approximation Theory</journal>
<volume>251, Article 105339</volume>
<authors>
<person>
<fn>Elena</fn>
<sn>Berdysheva</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Katharina</fn>
<sn>Hennings</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>doganay20gradient</citeid>
<title>Gradient based biobjective shape optimization to improve reliability and cost of ceramic components</title>
<year>2020</year>
<DOI>10.1007/s11081-019-09478-7</DOI>
<journal>Optimization and Engineering</journal>
<volume>21</volume>
<pages>1359-1387</pages>
<number>4</number>
<keywords>given</keywords>
<authors>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>Camilla</fn>
<sn>Hahn</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Johanna</fn>
<sn>Schultes</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannNR2018</citeid>
<title>Discrete operators associated with linking operators</title>
<year>2020</year>
<DOI>10.1007/s13324-020-00423-x</DOI>
<journal>Analysis and Mathematical Physics</journal>
<volume>10</volume>
<number>72</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Fadel</fn>
<sn>Nasaireh</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>stiglmayr20layout</citeid>
<title>Layout problems with reachability constraint</title>
<year>2020</year>
<DOI>10.1007/978-3-030-48439-2</DOI>
<booktitle>Operations Research Proceedings 2019</booktitle>
<publisher>Springer</publisher>
<address>Cham</address>
<editor>J. S. Neufeld and U. Buscher and R. Lasch and D. Möst and J. Schönberger</editor>
<event_name>Operations Research 2019</event_name>
<event_place>Dresden</event_place>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schulze20rectangular</citeid>
<title>On the Rectangular Knapsack Problem Approximation of a Specific Quadratic Knapsack Problem
</title>
<year>2020</year>
<DOI>10.1007/s00186-020-00702-0</DOI>
<journal>Mathematical Methods of Operations Research</journal>
<volume>92</volume>
<pages>107-132</pages>
<number>1</number>
<authors>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
<person>
<fn>David</fn>
<sn>Willems</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klamroth20network</citeid>
<title>Network Simulation for Pedestrian Flows with HyDEFS</title>
<year>2020</year>
<DOI>10.17815/CD.2020.24</DOI>
<journal>Collective Dynamics</journal>
<volume>5</volume>
<pages>1-16</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Bruno</fn>
<sn>Lang</sn>
</person>
<person>
<fn>Armin</fn>
<sn>Seyfried</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Acustrong2020</citeid>
<title>Strong converse results for linking operators and convex functions</title>
<year>2020</year>
<DOI>10.1155/2020/4049167</DOI>
<journal>Journal of Function Spaces</journal>
<volume>2020</volume>
<pages>4049167</pages>
<number>1</number>
<authors>
<person>
<fn>Ana-Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>BurgerPTTR2020</citeid>
<title>Instantaneous control of interacting particle systems in the mean-field limit</title>
<year>2020</year>
<DOI>10.48550/arXiv.1903.12407</DOI>
<journal>Journal of Computational Physics</journal>
<volume>405</volume>
<pages>109181</pages>
<authors>
<person>
<fn>Martin</fn>
<sn>Burger</sn>
</person>
<person>
<fn>Rene</fn>
<sn>Pinnau</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Oliver</fn>
<sn>Tse</sn>
</person>
<person>
<fn>Andreas</fn>
<sn>Roth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>PinnauT2020</citeid>
<title>Space mapping-based receding horizon control for stochastic interacting particle systems: dogs herding sheep</title>
<year>2020</year>
<DOI>10.1186/s13362-020-00077-1</DOI>
<journal>Journal of Mathematics in Industry</journal>
<volume>10</volume>
<number>11</number>
<authors>
<person>
<fn>Rene</fn>
<sn>Pinnau</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>TotzeckW2020</citeid>
<title>Consensus-Based Global Optimization with Personal Best</title>
<year>2020</year>
<DOI>10.3934/mbe.2020320</DOI>
<journal>Mathematical Biosciences and Engineering</journal>
<volume>17</volume>
<pages>6026-6044</pages>
<number>5</number>
<authors>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Marie-Therese</fn>
<sn>Wolfram</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>SchlachterT2020</citeid>
<title>Parameter identification in uncertain scalar conservation laws discretized with the discontinuous stochastic Galerkin Scheme</title>
<year>2020</year>
<DOI>10.4208/cicp.OA-2019-0221</DOI>
<journal>Communications in Computational Physics</journal>
<volume>28</volume>
<pages>1585-1608</pages>
<number>4</number>
<authors>
<person>
<fn>Louisa</fn>
<sn>Schlachter</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Totzeck2020</citeid>
<title>An anisotropic interaction model with collision avoidance</title>
<year>2020</year>
<DOI>10.48550/arXiv.1912.04234</DOI>
<journal>Kinetic and Related Models</journal>
<volume>13</volume>
<pages>1219-1242</pages>
<number>6</number>
<authors>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>Heilmannnote2020</citeid>
<title>Note on a proof for the representation of the kth order Kantorovich modification of linking Baskakov type operators</title>
<year>2020</year>
<DOI>10.1007/978-981-15-1153-0_8</DOI>
<booktitle>Mathematical Analysis I: Approximation Theory </booktitle>
<publisher>Springer Singapore</publisher>
<editor>Deo, Naokant and Gupta, Vijay and Acu, Ana Maria and Agrawal, P. N.</editor>
<pages>89–93</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>Acu2020</citeid>
<title>Linking Baskakov type operators</title>
<year>2020</year>
<booktitle>CONSTRUCTIVE THEORY OF FUNCTIONS, Sozopol 2019</booktitle>
<publisher>Prof. Marin Drinov Academic Publishing House</publisher>
<pages>23-38</pages>
<file_url>http://www.math.bas.bg/mathmod/Proceedings_CTF/C</file_url>
<authors>
<person>
<fn>Ana Maria</fn>
<sn>Acu</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schnepper18exact</citeid>
<title>Exact Algorithms for Handling Outliers in Center Location Problems on Networks Using k-max Functions</title>
<year>2019</year>
<issn>0377-2217</issn>
<DOI>10.1016/j.ejor.2018.08.030</DOI>
<journal>European Journal of Operational Research</journal>
<volume>273</volume>
<pages>441-451</pages>
<number>2</number>
<authors>
<person>
<fn>Teresa</fn>
<sn>Schnepper</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Justo</fn>
<sn>Puerto</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>stiglmayr19ass</citeid>
<title>Assigning Students to Schools for an Internship</title>
<year>2019</year>
<DOI>10.1007/978-3-030-18500-8_20</DOI>
<booktitle>Operations Research Proceedings 2018</booktitle>
<publisher>Springer</publisher>
<address>Cham</address>
<editor>Fortz B. and Labbé M.</editor>
<pages>151-157</pages>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Simon</fn>
<sn>Görtz</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>lang19fachlichkeitsaspekte</citeid>
<title>Die Stimmen der Fächer hören</title>
<year>2019</year>
<month>10</month>
<DOI>10.30965/9783657792740_025</DOI>
<booktitle>Die Stimmen der Fächer hören</booktitle>
<publisher>Schoeningh Ferdinand GmbH</publisher>
<chapter>Fachlichkeitsaspekte im Mathematik- und Informatikstudium</chapter>
<editor>Michaela Heer and Ulrich Heinen</editor>
<pages>413--428</pages>
<authors>
<person>
<fn>Bruno</fn>
<sn>Lang</sn>
</person>
<person>
<fn>Dorothee</fn>
<sn>Müller</sn>
</person>
<person>
<fn>Holger</fn>
<sn>Arndt</sn>
</person>
<person>
<fn>Andreas</fn>
<sn>Bartel</sn>
</person>
<person>
<fn>Karsten</fn>
<sn>Blankenagel</sn>
</person>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Günther</sn>
</person>
<person>
<fn>Ludger</fn>
<sn>Humbert</sn>
</person>
<person>
<fn>Birgit</fn>
<sn>Jacob</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Barbara</fn>
<sn>Rüdiger</sn>
</person>
<person>
<fn>Britta</fn>
<sn>Späth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Christian</fn>
<sn>Wyss</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>EicKlaNie19</citeid>
<title>Using a {B}&{B} algorithm from multiobjective optimization to solve constrained optimization problems</title>
<year>2019</year>
<DOI>10.1063/1.5089995</DOI>
<booktitle>AIP Conference Proceedings 2070</booktitle>
<publisher>AIP Publishing</publisher>
<authors>
<person>
<fn>Gabriele</fn>
<sn>Eichfelder</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Julia</fn>
<sn>Niebling</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bock2019MOTSP</citeid>
<title>Combining Traveling Salesman and Traveling Repairman Problems: A multi-objective approach based on multiple scenarios</title>
<year>2019</year>
<DOI>10.1016/j.cor.2019.104766</DOI>
<journal>Computers and Operations Research</journal>
<volume>112</volume>
<pages>104766</pages>
<authors>
<person>
<fn>Stefan</fn>
<sn>Bock</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>techreport</bibtype>
<citeid>przybylski2019dichotomic</citeid>
<title>A simple and efficient dichotomic search algorithm for
multi-objective mixed integer linear programs</title>
<year>2019</year>
<DOI>10.48550/arXiv.1911.08937</DOI>
<institution>arXiv</institution>
<number>1911.08937</number>
<web_url>https://arxiv.org/abs/1911.08937</web_url>
<file_url>https://arxiv.org/pdf/1911.08937.pdf</file_url>
<authors>
<person>
<fn>Anthony</fn>
<sn>Przybylski</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Renaud</fn>
<sn>Lacour</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>hartetal19</citeid>
<title>Interactive nonconvex Pareto navigator for multiobjective optimization</title>
<year>2019</year>
<DOI>10.1016/j.ejor.2018.11.038</DOI>
<journal>European Journal of Operational Research</journal>
<volume>275</volume>
<pages>238-251</pages>
<number>1</number>
<authors>
<person>
<fn>Markus</fn>
<sn>Hartikainen</sn>
</person>
<person>
<fn>Kaisa</fn>
<sn>Miettinen</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schulze19multi</citeid>
<title>Multi-Objective Unconstrained Combinatorial Optimization: A Polynomial Bound on the Number of Extreme Supported Solutions</title>
<year>2019</year>
<DOI>10.1007/s10898-019-00745-6</DOI>
<journal>Journal of Global Optimization</journal>
<volume>74</volume>
<pages>495–522</pages>
<number>3</number>
<tags>MONO-EMC</tags>
<authors>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>book</bibtype>
<citeid>klamroth19optimierung3</citeid>
<title>Optimierung als Bindeglied zwischen Schule, Anwendung und Forschung 3</title>
<year>2019</year>
<organization>Bergische Universität Wuppertal</organization>
<volume>3</volume>
<editor>Klamroth, Kathrin and Stiglmayr, Michael and Volkert, Klaus and Kraus, Konstantin and Reiners, Malena</editor>
<tags>KoLBi</tags>
<file_url>http://www-opt.math.uni-wuppertal.de/kolbi/Optimierung_als_Bindeglied_3.pdf</file_url>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Klaus</fn>
<sn>Volkert</sn>
</person>
<person>
<fn>Konstantin</fn>
<sn>Kraus</sn>
</person>
<person>
<fn>Malena</fn>
<sn>Reiners</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannNR2017</citeid>
<title>Complements to Voronovskaja's formula</title>
<year>2018</year>
<DOI>10.1007/978-981-13-2095-8</DOI>
<booktitle>Mathematics and Computing - ICMC 2018,</booktitle>
<volume>Springer Proceedings in Mathematics and Computing</volume>
<publisher>Springer</publisher>
<editor>Debdas Ghosh, Debasis Giri, Ram N. Mohapatra, Kouichi Sakurai, Ekrem Savas and Tanmoy Som</editor>
<pages>127-134</pages>
<event_name>ICMC 2018</event_name>
<event_place>Varanasi, India</event_place>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Fadel</fn>
<sn>Nasaireh</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannR2017</citeid>
<title>C0-semigroups associated with uniquely ergodic Kantorovich modifications of operators</title>
<year>2018</year>
<DOI>10.1007/s11117-017-0547-0</DOI>
<journal>Positivity</journal>
<volume>22</volume>
<pages>829-835</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>ASMETurbo2018</citeid>
<title>Adjoint method to calculate the shape gradients of
failure probabilities for turbomachinery components</title>
<year>2018</year>
<DOI>10.1115/GT2018-75759</DOI>
<journal>Conference Proceedings, ASME Turbo Expo</journal>
<authors>
<person>
<fn>Hanno</fn>
<sn>Gottschalk</sn>
</person>
<person>
<fn>Mohamed</fn>
<sn>Saadi</sn>
</person>
<person>
<fn>Onur Tanil</fn>
<sn>Doganay</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Sebastian</fn>
<sn>Schmitz</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>techreport</bibtype>
<citeid>schaefer2018shortest</citeid>
<title>Shortest Paths with Ordinal Weights</title>
<year>2018</year>
<DOI>10.48550/arXiv.1808.09410</DOI>
<institution>arXiv</institution>
<extern>1</extern>
<number>1808.09410</number>
<tags>MONO-EMC</tags>
<authors>
<person>
<fn>Luca E.</fn>
<sn>Schäfer</sn>
</person>
<person>
<fn>Tobias</fn>
<sn>Dietz</sn>
</person>
<person>
<fn>Nicolas</fn>
<sn>Fröhlich</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GOMES2018244</citeid>
<title>Implicit enumeration strategies for the hypervolume subset selection problem</title>
<year>2018</year>
<DOI>10.1016/j.cor.2018.07.003</DOI>
<journal>Computers & Operations Research</journal>
<volume>100</volume>
<pages>244 - 253</pages>
<extern>1</extern>
<tags>MONO-EMC</tags>
<authors>
<person>
<fn>Ricardo J.</fn>
<sn>Gomes</sn>
</person>
<person>
<fn>Andreia P.</fn>
<sn>Guerreiro</sn>
</person>
<person>
<fn>Tobias</fn>
<sn>Kuhn</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>CarrilloCTT2018</citeid>
<title>An analytical framework for a consensus-based global optimization method</title>
<year>2018</year>
<DOI>10.48550/arXiv.1602.00220</DOI>
<journal>Mathematical Models and Methods in Applied Sciences</journal>
<volume>28</volume>
<pages>1037-1066</pages>
<number>6</number>
<authors>
<person>
<fn>Jose</fn>
<sn>Carrillo</sn>
</person>
<person>
<fn>Young-Pil</fn>
<sn>Choi</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Oliver</fn>
<sn>Tse</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann2018</citeid>
<title>A nice representation for a link between Baskakov-and Szász–Mirakjan–Durrmeyer operators and their kantorovich variants</title>
<year>2018</year>
<DOI>10.1007/s00025-018-0932-4</DOI>
<journal>Results in Mathematics</journal>
<volume>74</volume>
<pages>9</pages>
<number>1</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannNR2016</citeid>
<title>Beta and related operators revisited</title>
<year>2018</year>
<booktitle>Constructive Theory of Functions, Proceedings</booktitle>
<publisher>Prof. Marin Drinov Academic Publishing House</publisher>
<editor>K. Ivanov, G. Nikolov, R. Uluchev</editor>
<pages>175-185</pages>
<event_name>CTF 2016</event_name>
<event_place>Sozopol, Bulgaria</event_place>
<file_url>http://www.math.bas.bg/mathmod/Proceedings_CTF/CTF-2016/files_CTF-2016/C-10-Heilman_NR.pdf</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Fadel</fn>
<sn>Nasaireh</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>book</bibtype>
<citeid>klamroth18optimierung2</citeid>
<title>Optimierung als Bindeglied zwischen Schule, Anwendung und Forschung 2</title>
<year>2018</year>
<organization>Bergische Universität Wuppertal</organization>
<volume>1</volume>
<editor>Klamroth, Kathrin and Stiglmayr, Michael and Volkert, Klaus and Kraus, Konstantin and Reiners, Malena</editor>
<tags>KoLBi</tags>
<file_url>http://www-opt.math.uni-wuppertal.de/kolbi/Optimierung_als_Bindeglied_2.pdf</file_url>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Klaus</fn>
<sn>Volkert</sn>
</person>
<person>
<fn>Konstantin</fn>
<sn>Kraus</sn>
</person>
<person>
<fn>Malena</fn>
<sn>Reiners</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>DachertSSGM2017</citeid>
<title>A Bicriteria Perspective on L-Penalty Approaches –
A Corrigendum to Siddiqui and Gabriel's L-Penalty Approach for
Solving MPECS</title>
<status>2</status>
<year>2017</year>
<DOI>10.48550/arXiv.1807.09340</DOI>
<journal>Networks and Spatial Economics</journal>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Sauleh</fn>
<sn>Siddiqui</sn>
</person>
<person>
<fn>Javier</fn>
<sn>Saez-Gallego</sn>
</person>
<person>
<fn>Steven</fn>
<sn>Gabriel</sn>
</person>
<person>
<fn>Juan Miguel</fn>
<sn>Morales</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>emo2017proceedings</citeid>
<title>Evolutionary Multi-Criterion Optimization</title>
<type>Proceedings</type>
<year>2017</year>
<DOI>10.1007/978-3-540-70928-2</DOI>
<volume>10173</volume>
<publisher>Springer</publisher>
<series>Lecture Notes in Computer Science</series>
<event_name>EMO 2017</event_name>
<event_place>Münster, Germany</event_place>
<authors>
<person>
<fn>Heike</fn>
<sn>Trautmann</sn>
</person>
<person>
<fn>Günter</fn>
<sn>Rudolph</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Oliver</fn>
<sn>Schütze</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
<person>
<fn>Yaochu</fn>
<sn>Jin</sn>
</person>
<person>
<fn>Christian</fn>
<sn>Grimme</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>schnepper17location</citeid>
<title>Location problems with k-max functions: modelling and analysing outliers in center problems</title>
<type>Dissertation</type>
<year>2017</year>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhsmig/download/pdf/3555328</file_url>
<authors>
<person>
<fn>Teresa</fn>
<sn>Schnepper</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>book</bibtype>
<citeid>klamroth17optimierung</citeid>
<title>Optimierung als Bindeglied zwischen Schule, Anwendung und Forschung</title>
<year>2017</year>
<organization>Bergische Universität Wuppertal</organization>
<volume>1</volume>
<editor>Klamroth, Kathrin and Stiglmayr, Michael and Volkert, Klaus and Pahl, Lisa</editor>
<tags>KoLBi</tags>
<file_url>http://www-opt.math.uni-wuppertal.de/kolbi/Optimierung_als_Bindeglied_1.pdf</file_url>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Klaus</fn>
<sn>Volkert</sn>
</person>
<person>
<fn>Lisa</fn>
<sn>Pahl</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>SchuNewp2017</citeid>
<title>New Perspectives on Multi-Objective Knapsack Problems</title>
<year>2017</year>
<month>12</month>
<isbn>978-3-8440-5631-0</isbn>
<organization>University of Wuppertal</organization>
<publisher>Shaker Verlag</publisher>
<address>Aachen</address>
<tags>DAAD-Paris, MONO-EMC</tags>
<authors>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>PinnauTT2017</citeid>
<title>The quasi-neutral limit in optimal semiconductor design</title>
<year>2017</year>
<reviewed>1</reviewed>
<DOI>10.1137/15M1051877</DOI>
<journal>SIAM Journal of Control and Optimization</journal>
<volume>55</volume>
<pages>2603-2635</pages>
<number>4</number>
<authors>
<person>
<fn>Rene</fn>
<sn>Pinnau</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Oliver</fn>
<sn>Tse</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>PinnauTTM2017</citeid>
<title>A consensus-based model for global optimization and its mean-field limit</title>
<year>2017</year>
<reviewed>1</reviewed>
<DOI>10.48550/arXiv.1604.05648</DOI>
<journal>Mathematical Models and Methods in Applied Sciences</journal>
<volume>27</volume>
<pages>183-204</pages>
<number>1</number>
<authors>
<person>
<fn>Rene</fn>
<sn>Pinnau</sn>
</person>
<person>
<fn>Claudia</fn>
<sn>Totzeck</sn>
</person>
<person>
<fn>Oliver</fn>
<sn>Tse</sn>
</person>
<person>
<fn>Stephan</fn>
<sn>Martin</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannRasa2016</citeid>
<title>Eigenstructure and iterates for uniquely ergodic
Kantorovich modifications of operators</title>
<year>2017</year>
<DOI>10.1007/s11117-016-0441-1</DOI>
<journal>Positivity</journal>
<volume>21 (3)</volume>
<pages>897-910</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>daechert16efficient</citeid>
<title>Efficient computation of the search region in multi-objective optimization</title>
<year>2017</year>
<DOI>10.1016/j.ejor.2016.05.029</DOI>
<journal>European Journal of Operational Research</journal>
<volume>260</volume>
<pages>841–855</pages>
<number>3</number>
<tags>DAAD-Paris</tags>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Renaud</fn>
<sn>Lacour</sn>
</person>
<person>
<fn>Daniel</fn>
<sn>Vanderpooten</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Lacour2016</citeid>
<title>A box decomposition algorithm to compute the hypervolume indicator</title>
<year>2017</year>
<issn>0305-0548</issn>
<DOI>10.1016/j.cor.2016.06.021</DOI>
<journal>Computers & Operations Research</journal>
<edition>79</edition>
<pages>347-360</pages>
<tags>DAAD-Paris</tags>
<authors>
<person>
<fn>Renaud</fn>
<sn>Lacour</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>figueira16easy</citeid>
<title>Easy to say they're hard, but hard to see they're easy - Toward a categorization of tractable multiobjective combinatorial optimization problems</title>
<year>2017</year>
<month>7</month>
<DOI>10.1002/mcda.1574</DOI>
<journal>Journal of Multi-Criteria Decision Analysis</journal>
<edition>1-2</edition>
<volume>24</volume>
<pages>82-98</pages>
<tags>DAAD-Paris, MONO-EMC</tags>
<authors>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
<person>
<fn>Pascal</fn>
<sn>Halffmann</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>David</fn>
<sn>Willems</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schu:bidi:2016</citeid>
<title>Bi-dimensional knapsack problems with one soft constraint</title>
<year>2017</year>
<DOI>10.1016/j.cor.2016.07.012</DOI>
<journal>Computers & Operations Research</journal>
<volume>78</volume>
<pages>15-26</pages>
<tags>MONO-EMC</tags>
<authors>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klamroth16multi</citeid>
<title>Multiobjective optimization for interwoven systems</title>
<year>2017</year>
<DOI>10.1002/mcda.1598</DOI>
<journal>Journal of Multi-Criteria Decision Analysis</journal>
<edition>1-2</edition>
<volume>24</volume>
<pages>71-81</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Sanaz</fn>
<sn>Mostaghim</sn>
</person>
<person>
<fn>Boris</fn>
<sn>Naujoks</sn>
</person>
<person>
<fn>Silvia</fn>
<sn>Poles</sn>
</person>
<person>
<fn>Robin</fn>
<sn>Purshouse</sn>
</person>
<person>
<fn>Günter</fn>
<sn>Rudolph</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
<person>
<fn>Serpil</fn>
<sn>Sayin</sn>
</person>
<person>
<fn>Margaret</fn>
<sn>Wiecek</sn>
</person>
<person>
<fn>Xin</fn>
<sn>Yao</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>allmendinger16nav</citeid>
<title>Navigation in multiobjective optimization methods</title>
<year>2017</year>
<DOI>10.1002/mcda.1599</DOI>
<journal>Journal of Multi-Criteria Decision Analysis</journal>
<volume>24</volume>
<pages>57-70</pages>
<authors>
<person>
<fn>Richard</fn>
<sn>Allmendinger</sn>
</person>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>Xavier</fn>
<sn>Gandibleux</sn>
</person>
<person>
<fn>Martin J.</fn>
<sn>Geiger</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Mariano</fn>
<sn>Luque</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Klamroth2017</citeid>
<title>A unified approach to uncertain optimization</title>
<year>2017</year>
<DOI>10.1016/j.ejor.2016.12.045</DOI>
<journal>European Journal of Operational Research</journal>
<volume>260</volume>
<pages>403-420</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Elisabeth</fn>
<sn>Köbis</sn>
</person>
<person>
<fn>Anita</fn>
<sn>Schöbel</sn>
</person>
<person>
<fn>Christiane</fn>
<sn>Tammer</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>BaumannHeilmannRasa2016</citeid>
<title>Further results for k-th order Kantorovich modification of linking Baskakov type operators</title>
<year>2016</year>
<issn>1420-9012</issn>
<DOI>10.1007/s00025-015-0511-x</DOI>
<journal>Results in Mathematics</journal>
<volume>69</volume>
<pages>297-315</pages>
<number>3</number>
<authors>
<person>
<fn>Katharina</fn>
<sn>Baumann</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AralGHT2016</citeid>
<title>Quantitative Voronovskaya-type Results for Polynomially Bounded Functions</title>
<year>2016</year>
<DOI>10.1007/s00025-016-0580-5</DOI>
<journal>Results in Mathematics</journal>
<volume>70</volume>
<pages>313-324</pages>
<note>full-text view-only version available:
http://rdcu.be/kdqv</note>
<authors>
<person>
<fn>Ali</fn>
<sn>Aral</sn>
</person>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>G.</fn>
<sn>Tachev</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GonskaHR2016</citeid>
<title>Eigenstructure of the genuine Beta operators of Lupaş and Mühlbach</title>
<year>2016</year>
<journal>Stud. Univ. Babes-Bolyai Math.</journal>
<volume>61</volume>
<pages>383-388</pages>
<number>3</number>
<file_url>https://www.cs.ubbcluj.ro/~studia-m/index.php/journal/article/view/140/pdf</file_url>
<authors>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>kaiser15spatial</citeid>
<title>Spatial Uncertainties in Continuous Location Problems</title>
<type>Dissertation</type>
<year>2015</year>
<school>Bergische Universität Wuppertal</school>
<authors>
<person>
<fn>Markus</fn>
<sn>Kaiser</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>brockhoff15computational</citeid>
<title>Computational Complexity</title>
<year>2015</year>
<DOI>10.4230/DagRep.5.1.96</DOI>
<booktitle>Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031)</booktitle>
<editor>Salvatore Greco and Kathrin Klamroth and Joshua D. Knowles and Günter Rudolph</editor>
<web_url>http://drops.dagstuhl.de/opus/volltexte/2015/5037</web_url>
<authors>
<person>
<fn>Dimo</fn>
<sn>Brockhoff</sn>
</person>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Luis</fn>
<sn>Martí</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Daniel</fn>
<sn>Vanderpooten</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>greco15dagstuhl</citeid>
<title>Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031)</title>
<year>2015</year>
<issn>2192-5283</issn>
<DOI>10.4230/DagRep.5.1.96</DOI>
<journal>Dagstuhl Reports</journal>
<edition>1</edition>
<volume>5</volume>
<publisher>Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik</publisher>
<address>Dagstuhl, Germany</address>
<pages>96-163</pages>
<number>1</number>
<authors>
<person>
<fn>Salvatore</fn>
<sn>Greco</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Joshua D.</fn>
<sn>Knowles</sn>
</person>
<person>
<fn>Günter</fn>
<sn>Rudolph</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>vaz15representation</citeid>
<title>Representation of the non-dominated set in biobjective combinatorial optimization</title>
<year>2015</year>
<DOI>10.1016/j.cor.2015.05.003</DOI>
<organization>Bergische Universität Wuppertal</organization>
<journal>Computers &amp; Operations Research</journal>
<volume>63</volume>
<pages>172-186</pages>
<authors>
<person>
<fn>Daniel</fn>
<sn>Vaz</sn>
</person>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Carlos M.</fn>
<sn>Fonseca</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>daec:alin:2015</citeid>
<title>A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems</title>
<year>2015</year>
<DOI>10.1007/s10898-014-0205-z</DOI>
<journal>Journal of Global Optimization</journal>
<volume>61</volume>
<pages>643–676</pages>
<number>4</number>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:onth:2015</citeid>
<title>On the representation of the search region in multi-objective optimization</title>
<year>2015</year>
<DOI>10.48550/arXiv.1502.06111</DOI>
<journal>European Journal of Operational Research</journal>
<volume>245</volume>
<pages>767-778</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Renaud</fn>
<sn>Lacour</sn>
</person>
<person>
<fn>Daniel</fn>
<sn>Vanderpooten</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann2016</citeid>
<title>Commutativity and Spectral Properties of Genuine Baskakov-Durrmeyer Type Operators and their kth order Kantorovich Modification</title>
<year>2015</year>
<journal>Journal of Numerical Analysis and Approximation Theory</journal>
<volume>44</volume>
<pages>166-179</pages>
<number>2</number>
<file_url>https://ictp.acad.ro/jnaat/journal/article/view/2015-vol44-no2-art5</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannRasa2015-1</citeid>
<title>k-th order Kantorovich type modification of linking Baskakov type operators</title>
<year>2015</year>
<DOI>10.1007/978-81-322-2485-3</DOI>
<booktitle>Mathematical Analysis and its Applications - Proceedings of the Conference ICRTMAA 2014, Roorkee, India</booktitle>
<volume>143</volume>
<publisher>Springer</publisher>
<series>Springer Proceedings in Mathematics and Statistics</series>
<editor>Agrawal, P.N. and Mohapatra, R.N. and Singh, U. and Srivastava, H.M.</editor>
<pages>229-242</pages>
<event_name>International Conference on Recent Trends in Mathematical Analysis and its Applications</event_name>
<event_place>Roorkee, India</event_place>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannRasa2015</citeid>
<title>On the decomposition of Bernstein operators</title>
<year>2015</year>
<DOI>10.1080/01630563.2014.951772</DOI>
<journal>Numerical Functional Analysis and Optimization</journal>
<volume>36</volume>
<pages>72-85</pages>
<number>1</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>daechert14adaptive</citeid>
<title>Adaptive Parametric Scalarizations in Multicriteria Optimization</title>
<type>Dissertation</type>
<year>2014</year>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhsmig/download/pdf/3554118</file_url>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>stiglmayr14multicriteria</citeid>
<title>On the multicriteria allocation problem</title>
<year>2014</year>
<DOI>10.1007/s10479-013-1356-x</DOI>
<journal>Annals of Operations Research</journal>
<volume>222</volume>
<publisher>Springer</publisher>
<pages>535-549</pages>
<number>1</number>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannRasa2014</citeid>
<title>k-th order Kantorovich type modification of the operators U_n^ρ</title>
<year>2014</year>
<DOI>10.1007/978-81-322-2485-3_18</DOI>
<journal>Journal of Applied Functional Analysis</journal>
<volume>9</volume>
<pages>20-334</pages>
<number>3-4</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>raith13multiobjective</citeid>
<title>Multi-Objective Combinatorial Optimization</title>
<year>2013</year>
<booktitle>Newsletter of the EURO Working Group on Multicriteria Decision Making</booktitle>
<pages>9-12</pages>
<number>27</number>
<file_url>http://www.cs.put.poznan.pl/ewgmcda/newsletter/Spr13.pdf</file_url>
<authors>
<person>
<fn>Andrea</fn>
<sn>Raith</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>rong13multicriteria</citeid>
<title>Multicriteria 0-1 knapsack problems with k-min objectives</title>
<year>2013</year>
<DOI>10.1016/j.cor.2012.10.010</DOI>
<journal>Computers and Operations Research</journal>
<volume>40</volume>
<pages>1481-1496</pages>
<authors>
<person>
<fn>Aiying</fn>
<sn>Rong</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bock:mini:2013</citeid>
<title>Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions</title>
<year>2013</year>
<DOI>10.1007/s10951-013-0334-0</DOI>
<journal>Journal of Scheduling</journal>
<volume>16</volume>
<pages>479-494</pages>
<authors>
<person>
<fn>Stefan</fn>
<sn>Bock</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:auni:2013</citeid>
<title>A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals</title>
<year>2013</year>
<DOI>10.1080/02331934.2013.769104</DOI>
<journal>Optimization</journal>
<volume>62</volume>
<pages>649-671</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Elisabeth</fn>
<sn>Köbis</sn>
</person>
<person>
<fn>Anita</fn>
<sn>Schöbel</sn>
</person>
<person>
<fn>Christiane</fn>
<sn>Tammer</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>paqu:onab:2013</citeid>
<title>On a biobjective search problem in a line: Formulations and algorithms</title>
<year>2013</year>
<DOI>10.1016/j.tcs.2013.02.016</DOI>
<journal>Theoretical Computer Science</journal>
<volume>507</volume>
<pages>61-71</pages>
<authors>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Mathias</fn>
<sn>Jaschob</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannTachev2013</citeid>
<title>Linear combinations of genuine Szász-Mirakjan-Durrmeyer operators</title>
<year>2013</year>
<DOI>10.1007/978-1-4614-6393-1</DOI>
<booktitle>Advances in Applied Mathematics and Approximation - Contributions from AMAT 2012</booktitle>
<volume>41</volume>
<publisher>Springer Proceedings in Mathematics and Statistics</publisher>
<editor>Anastassiou, George A. and Duman, Oktay</editor>
<pages>85-106</pages>
<event_name>Applied Mathematics and Approximation Theory 2012</event_name>
<event_place>Ankara, Turkey</event_place>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>G.</fn>
<sn>Tachev</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>raith12biobjectivecolumn</citeid>
<title>Exploring Bi-Objective Column Generation</title>
<year>2012</year>
<booktitle>Proceedings of the 46th Annual Conference of the Operations Research Society of New Zealand (ORSNZ)</booktitle>
<editor>John Haywood</editor>
<web_url>http://orsnz.org.nz/conf46/content/ORSNZ12_conference_proceedings.pdf</web_url>
<file_url>https://www.researchgate.net/publication/335540597_Exploring_Bi-Objective_Column_Generation</file_url>
<authors>
<person>
<fn>Andrea</fn>
<sn>Raith</sn>
</person>
<person>
<fn>Siamak</fn>
<sn>Moradi</sn>
</person>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>stiglmayr12mulit</citeid>
<title>On the multicriteria bottleneck assignment problem</title>
<year>2012</year>
<booktitle>Proceedings of the 46th Annual ORSNZ Conference</booktitle>
<web_url>http://orsnz.org.nz/conf46/content/ORSNZ12_conference_proceedings.pdf</web_url>
<file_url>https://www.researchgate.net/publication/335540679_On_the_Multicriteria_Linear_Bottleneck_Assignment_Problem</file_url>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>pfeuffer12discrete</citeid>
<title>Discrete and geometric Branch and Bound algorithms for medical image registration</title>
<year>2012</year>
<DOI>10.1007/s10479-010-0760-8</DOI>
<journal>Annals of Operations Research</journal>
<volume>196</volume>
<publisher>Springer</publisher>
<pages>737-765</pages>
<number>1</number>
<authors>
<person>
<fn>Frank</fn>
<sn>Pfeuffer</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>gorski12generalized</citeid>
<title>Generalized multiple objective bottleneck problems</title>
<year>2012</year>
<DOI>10.1016/j.orl.2012.03.007</DOI>
<journal>Operations Research Letters</journal>
<volume>40</volume>
<pages>276-281</pages>
<authors>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>daec:anau:2012</citeid>
<title>An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems</title>
<year>2012</year>
<DOI>10.1016/j.cor.2012.02.021</DOI>
<journal>Computers and Operations Research</journal>
<volume>39</volume>
<pages>2929–2943</pages>
<number>12</number>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>daec:mult:2012</citeid>
<title>Multicriteria Optimization in Wastewater Management</title>
<year>2012</year>
<DOI>10.1007/978-3-0348-0436-3_10</DOI>
<booktitle>Mathematical Optimization of Water Networks</booktitle>
<volume>162</volume>
<publisher>Birkhäuser</publisher>
<series>International Series of Numerical Mathematics</series>
<editor>Martin, A. and Klamroth, K. and Lang, J. and Leugering, G. and Morsi, A. and Oberlack, M. and Ostrowski, M. and R., Rosen</editor>
<pages>167-196</pages>
<authors>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>paqu:dyna:2012</citeid>
<title>Dynamic programming for a biobjective search problem in a line</title>
<year>2012</year>
<DOI>10.1007/978-3-642-31770-5_31</DOI>
<booktitle>Proceedings of COCOA 2012</booktitle>
<volume>7402</volume>
<series>LNCS</series>
<pages>348-359</pages>
<authors>
<person>
<fn>Luís</fn>
<sn>Paquete</sn>
</person>
<person>
<fn>Mathias</fn>
<sn>Jaschob</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>rong:dyna:2012</citeid>
<title>Dynamic programming based algorithms for the discounted 0-1 knapsack problem</title>
<year>2012</year>
<DOI>10.1016/j.amc.2011.12.068</DOI>
<journal>Applied Mathematics and Computation</journal>
<volume>218</volume>
<pages>6921-6933</pages>
<authors>
<person>
<fn>Aiying</fn>
<sn>Rong</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GonskaHeilmannLupasRasa2012</citeid>
<title>On the composition and decomposition of positive linear operators III: A non-trivial decomposition of the Bernstein operator</title>
<year>2012</year>
<DOI>10.48550/arXiv.1204.2723</DOI>
<authors>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Alexandru</fn>
<sn>Lupaş</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannWagner2012</citeid>
<title>Strong converse results for Baskakov-Durrmeyer operators</title>
<year>2012</year>
<booktitle>Constructive Theory of Functions, Proceedings of the International Conference, Sozopol, Bulgaria, 2010</booktitle>
<publisher>Prof. Marin Drinov Academic Publishing House</publisher>
<editor>G. Nikolov et al.</editor>
<pages>141-149</pages>
<event_name>Constructive Theory of Functions</event_name>
<event_place>Sozopol, Bulgaria</event_place>
<file_url>http://www.math.bas.bg/mathmod/Proceedings_CTF/CTF-2010/files_CTF-2010/17-Heilmann.pdf</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>M.</fn>
<sn>Wagner</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannWagner2012-1</citeid>
<title>The genuine Bernstein-Durrmeyer operators and quasi-interpolants</title>
<year>2012</year>
<DOI>10.1007/s00025-012-0247-9</DOI>
<journal>Results in Mathematics</journal>
<volume>62</volume>
<pages>319-335</pages>
<number>3-4</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>M.</fn>
<sn>Wagner</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>mastersthesis</bibtype>
<citeid>schnepper11standortprobleme</citeid>
<title>Standortprobleme mit k-max Zielfunktion</title>
<year>2011</year>
<school>Bergische Universität Wuppertal</school>
<authors>
<person>
<fn>Teresa</fn>
<sn>Schnepper</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>stiglmayr11multicriteria</citeid>
<title>Multicriteria allocation problem</title>
<year>2011</year>
<DOI>10.1007/s10479-013-1356-x</DOI>
<booktitle>Proceedings of OR Peripatetic Post-Graduate Programme (ORP3-2011)</booktitle>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>José Rui</fn>
<sn>Figueira</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>gorski11multiobjective</citeid>
<title>Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization</title>
<year>2011</year>
<DOI>10.1007/s10957-011-9849-8</DOI>
<journal>Journal of Optimization Theory and Applications</journal>
<volume>150</volume>
<publisher>Springer</publisher>
<pages>475-497</pages>
<authors>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Ruzika</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GonskaHeilmannRasa2011</citeid>
<title>Kantorovich operators of order k</title>
<year>2011</year>
<DOI>10.1080/01630563.2011.580877</DOI>
<journal>Numerical Functional Analysis and Optimization</journal>
<volume>32</volume>
<pages>717-738</pages>
<number>7</number>
<authors>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannTachev2011</citeid>
<title>Commutativity, Direct and Strong Converse Results for Phillips Operators</title>
<year>2011</year>
<journal>East Journal on Approximation</journal>
<volume>17</volume>
<pages>299-317</pages>
<number>3</number>
<file_url>https://www.researchgate.net/publication/266063799_Commutativity_direct_and_strong_converse_results_for_Philipps_operators</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>G.</fn>
<sn>Tachev</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>mastersthesis</bibtype>
<citeid>SchuStoc2011</citeid>
<title>Stochastische p-robuste Lösungsverfahren für szenariobasierte Standortprobleme</title>
<year>2011</year>
<school>Bergische Universität Wuppertal</school>
<authors>
<person>
<fn>Britta</fn>
<sn>Schulze</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>gorski10multiple</citeid>
<title>Multiple objective optimization and implications for single objective optimization</title>
<type>Dissertation</type>
<year>2010</year>
<school>Bergische Universität Wuppertal</school>
<file_url>https://elekpub.bib.uni-wuppertal.de/ubwhsmig/download/pdf/3553142</file_url>
<authors>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>stiglmayr10discrete</citeid>
<title>Discrete and Continuous Optimization Problems Arising in Medical Image Registration</title>
<type>Dissertation</type>
<year>2010</year>
<isbn>3832294902</isbn>
<school>Bergische Universität Wuppertal</school>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>eske:pare:2010</citeid>
<title>Pareto navigator for interactive nonlinear multiobjective optimization</title>
<year>2010</year>
<DOI>10.1007/s00291-008-0151-6</DOI>
<journal>OR Spectrum</journal>
<volume>23</volume>
<pages>211-227</pages>
<authors>
<person>
<fn>Petri</fn>
<sn>Eskelinen</sn>
</person>
<person>
<fn>Kaisa</fn>
<sn>Miettinen</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Jussi</fn>
<sn>Hakanen</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>thek:opti:2010</citeid>
<title>Optimizing the number of multigrid cycles in the full multigrid algorithm</title>
<year>2010</year>
<DOI>10.1002/nla.697</DOI>
<journal>Numerical Linear Algebra with Applications</journal>
<volume>17</volume>
<pages>199-210</pages>
<authors>
<person>
<fn>Alexander</fn>
<sn>Thekale</sn>
</person>
<person>
<fn>Tobias</fn>
<sn>Gradl</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Ulrich</fn>
<sn>R&uuml;de</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GonskaHeilmannRasa2010</citeid>
<title>Asymptotic behaviour of differentiated Bernstein polynomials revisited</title>
<year>2010</year>
<journal>General Mathematics</journal>
<volume>18</volume>
<pages>55-70</pages>
<number>1</number>
<file_url>https://www.emis.de/journals/GM/vol18nr1/05_Gonska/05_Gonska.pdf</file_url>
<authors>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannWagner2010</citeid>
<title>Strong converse results for Bernstein-Durrmeyer operators and their quasi-interpolants</title>
<year>2010</year>
<journal>General Mathematics</journal>
<volume>18</volume>
<pages>45-53</pages>
<number>1</number>
<file_url>https://www.emis.de/journals/GM/vol18nr1/06_Heilmann/06_Heilmann.pdf</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>M.</fn>
<sn>Wagner</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>SchaeferBerchtholdHeilmannZmudzinskiSteinebach2010</citeid>
<title>Collosion secure fingerprint watermarking for real world applications</title>
<year>2010</year>
<booktitle>GI-Edition - Lecture Notes in Informatics, Beiträge der 5. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft f</booktitle>
<publisher>Bonner K</publisher>
<pages>129-140</pages>
<file_url>https://dl.gi.de/bitstream/handle/20.500.12116/19776/129.pdf?sequence=1&isAllowed=y</file_url>
<note>Felix C. Freiling (Hrsg.)</note>
<authors>
<person>
<fn>M.</fn>
<sn>Schäfer</sn>
</person>
<person>
<fn>W.</fn>
<sn>Berchtold</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>S.</fn>
<sn>Zmudzinski</sn>
</person>
<person>
<fn>M.</fn>
<sn>Steinebach</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>BischoffD2009</citeid>
<title>Allocation search methods for a generalized class
of location-allocation problems</title>
<year>2009</year>
<DOI>10.1016/j.ejor.2007.10.022</DOI>
<journal>European Journal of Operational Research</journal>
<volume>192</volume>
<pages>793–807</pages>
<number>3</number>
<authors>
<person>
<fn>Martin</fn>
<sn>Bischoff</sn>
</person>
<person>
<fn>Kerstin</fn>
<sn>Dächert</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>thesis</bibtype>
<citeid>schnepper09Sloesung</citeid>
<title>Lösung des Travelling Salesman Problem mit Zeitfenstern mittels Heuristiken im Rahmen einer dynamischen Nachlieferung</title>
<type>Bachelor Thesis</type>
<year>2009</year>
<file_url>http://www2.math.uni-wuppertal.de/~tschnepp/Bachelor%20Thesis%20Schnepper.pdf</file_url>
<authors>
<person>
<fn>Teresa</fn>
<sn>Schnepper</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>museyko09application</citeid>
<title>On the Application of the Monge-Kantorovich Problem to Image Registration</title>
<year>2009</year>
<DOI>10.1137/080721522</DOI>
<journal>SIAM Journal on Imaging Sciences</journal>
<volume>2</volume>
<publisher>Society for Industrial &amp; Applied Mathematics (SIAM)</publisher>
<pages>1068-1097</pages>
<number>4</number>
<authors>
<person>
<fn>Oleg</fn>
<sn>Museyko</sn>
</person>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Günter</fn>
<sn>Leugering</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bisc:them:2009</citeid>
<title>The multi-facility location-allocation problem with polyhedral barriers</title>
<year>2009</year>
<DOI>10.1016/j.cor.2008.02.014</DOI>
<journal>Computers and Operations Research</journal>
<volume>36</volume>
<pages>1376-1392</pages>
<authors>
<person>
<fn>Martin</fn>
<sn>Bischoff</sn>
</person>
<person>
<fn>Tina</fn>
<sn>Fleischmann</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>GonskaHeilmannRasa2009</citeid>
<title>Convergence of iterates of genuine and ultraspherical Durrmeyer operators to the limiting semigroup: C^2-estimates</title>
<year>2009</year>
<DOI>10.1016/j.jat.2008.11.002</DOI>
<journal>Journal Approx. Theory</journal>
<volume>160</volume>
<pages>243-255</pages>
<authors>
<person>
<fn>Heiner</fn>
<sn>Gonska</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Ioan</fn>
<sn>Raşa</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>stiglmayr08branch</citeid>
<title>A Branch &amp; Bound Algorithm for Medical Image Registration</title>
<year>2008</year>
<DOI>10.1007/978-3-540-78275-9_19</DOI>
<booktitle>Proceedings of the 12th International Workshop on Combinatorial Image Analysis (IWCIA 08)</booktitle>
<volume>4958</volume>
<publisher>Springer Berlin / Heidelberg</publisher>
<series>LNCS</series>
<editor>V.E. Brimkov and R.P. Barneva and H.A.\ Hauptman</editor>
<pages>218-227</pages>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Frank</fn>
<sn>Pfeuffer</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Klamroth2008</citeid>
<title>Integrating approximation and interactive decision making in multicriteria optimization</title>
<year>2008</year>
<DOI>10.1287/opre.1070.0425</DOI>
<journal>Operations Research</journal>
<volume>56</volume>
<pages>222 - 234</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Kaisa</fn>
<sn>Miettinen</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>stiglmayr08registration</citeid>
<title>Registration of PE segment contour deformations in digital high-speed videos</title>
<year>2008</year>
<DOI>10.1016/j.media.2007.12.001</DOI>
<journal>Medical Image Analysis</journal>
<volume>12</volume>
<publisher>Elsevier BV</publisher>
<pages>318–334</pages>
<number>3</number>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
<person>
<fn>Raphael</fn>
<sn>Schwarz</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Günter</fn>
<sn>Leugering</sn>
</person>
<person>
<fn>J&ouml;rg</fn>
<sn>Lohscheller</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>hama:stan:2008</citeid>
<title>Standortoptimierung</title>
<year>2008</year>
<booktitle>Die Kunst des Modellierens: Mathematisch-ökonomische Modelle</booktitle>
<publisher>Teubner-Verlag</publisher>
<editor>Luderer, B.</editor>
<pages>139-156</pages>
<authors>
<person>
<fn>Horst W.</fn>
<sn>Hamacher</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Christiane</fn>
<sn>Tammer</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>pfei:auni:2008</citeid>
<title>A unified model for Weber problems with continuous and network distances</title>
<year>2008</year>
<DOI>10.1016/j.cor.2006.03.001</DOI>
<journal>Computers and Operations Research</journal>
<volume>35</volume>
<pages>312-326</pages>
<authors>
<person>
<fn>Barbara</fn>
<sn>Pfeiffer</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>weih:dete:2008</citeid>
<title>Determination of the cable factor for deviated bundle tendons and stay cables</title>
<year>2008</year>
<DOI>10.2749/101686608783726731</DOI>
<journal>Structural Engineering International</journal>
<volume>18</volume>
<pages>88-94</pages>
<authors>
<person>
<fn>Hermann</fn>
<sn>Weiher</sn>
</person>
<person>
<fn>Eckart</fn>
<sn>Specht</sn>
</person>
<person>
<fn>Barbara</fn>
<sn>Pfeiffer</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Konrad</fn>
<sn>Zilch</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>gorski07biconvex</citeid>
<title>Biconvex Sets and Optimization with Biconvex Functions - A Survey and Extensions</title>
<year>2007</year>
<DOI>10.1007/s00186-007-0161-1</DOI>
<journal>MMOR</journal>
<volume>66</volume>
<pages>373-407</pages>
<number>3</number>
<authors>
<person>
<fn>Jochen</fn>
<sn>Gorski</sn>
</person>
<person>
<fn>Frank</fn>
<sn>Pfeuffer</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>bisc:anef:2007</citeid>
<title>An efficient solution method for Weber problems with barriers based on genetic algorithms</title>
<year>2007</year>
<DOI>10.1016/j.ejor.2005.10.061</DOI>
<journal>European Journal of Operational Research</journal>
<volume>177</volume>
<pages>22-41</pages>
<authors>
<person>
<fn>Martin</fn>
<sn>Bischoff</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:cons:2007</citeid>
<title>Constrained optimization using multiple objective programming</title>
<year>2007</year>
<DOI>10.1007/s10898-006-9052-x</DOI>
<journal>Journal of Global Optimization</journal>
<volume>37</volume>
<pages>325-355</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Jørgen</fn>
<sn>Tind</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>gandibleux06cardinality</citeid>
<title>Cardinality Bounds for Multiobjective Knapsack Problems</title>
<year>2006</year>
<booktitle> Proceedings of the Multi-Objective Programming and Goal Programming Conference </booktitle>
<authors>
<person>
<fn>Xavier</fn>
<sn>Gandibleux</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>book</bibtype>
<citeid>hama:line:2006</citeid>
<title>Lineare und Netzwerkoptimierung - Linear and Network Optimization. Bilingual Textbook</title>
<year>2006</year>
<publisher>Vieweg</publisher>
<file_url>https://link.springer.com/content/pdf/10.1007/978-3-322-91579-5.pdf</file_url>
<note>2nd edition; 1st edition 2000</note>
<authors>
<person>
<fn>Horst W.</fn>
<sn>Hamacher</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>dear:plan:2005</citeid>
<title>Planar location problems with block distance and barriers</title>
<year>2005</year>
<DOI>10.1007/s10479-005-2042-4</DOI>
<journal>Annals of Operations Research</journal>
<volume>136</volume>
<pages>117-143</pages>
<authors>
<person>
<fn>P.M.</fn>
<sn>Dearing</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>R. Jr.</fn>
<sn>Segars</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>frie:awav:2005</citeid>
<title>A wavefront approach to center location problems with barriers</title>
<year>2005</year>
<DOI>10.1007/s10479-005-2037-1</DOI>
<journal>Annals of Operations Research</journal>
<volume>136</volume>
<pages>35-48</pages>
<authors>
<person>
<fn>L.</fn>
<sn>Frieß</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>M.</fn>
<sn>Sprau</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>huan:kcon:2005</citeid>
<title>K-connection location problem in a plane</title>
<year>2005</year>
<journal>Annals of Operations Research</journal>
<volume>136</volume>
<pages>193-209</pages>
<file_url>https://www.eng.buffalo.edu/~nagi/papers/paper_kconn.pdf</file_url>
<authors>
<person>
<fn>Simin</fn>
<sn>Huang</sn>
</person>
<person>
<fn>Rajan</fn>
<sn>Batta</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Rakesh</fn>
<sn>Nagi</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>pfei:bili:2005</citeid>
<title>Bilinear programming formulations for Weber problems with continuous and network distances</title>
<year>2005</year>
<DOI>10.15807/jorsj.48.123</DOI>
<journal>Journal of the Operations Research Society of Japan</journal>
<volume>48</volume>
<pages>123-134</pages>
<authors>
<person>
<fn>Barbara</fn>
<sn>Pfeiffer</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>reus:opti:2005</citeid>
<title>Optimisation of an alternative approach to power electronic structures in passenger vehicles</title>
<year>2005</year>
<DOI>10.4271/2005-01-1431</DOI>
<booktitle>6. Stuttgarter Symposium Kraftfahrwesen und Verbrennungsmotoren</booktitle>
<publisher>Expert Verlag</publisher>
<editor>Bargende, M. and Reuss, H.-C. and Wiedemann, J.</editor>
<authors>
<person>
<fn>H.-C.</fn>
<sn>Reuss</sn>
</person>
<person>
<fn>S.</fn>
<sn>Diesner</sn>
</person>
<person>
<fn>D.</fn>
<sn>Marquardt</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>mastersthesis</bibtype>
<citeid>stiglmayr04die</citeid>
<title>Die Bedeutung von Abstandsmaßen in der Data Envelopment Analysis</title>
<type>Diploma Thesis</type>
<year>2004</year>
<school>Universität Erlangen - Nürnberg, Institut für Angewandte Mathematik</school>
<authors>
<person>
<fn>Michael</fn>
<sn>Stiglmayr</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>ehrg:anmc:2004</citeid>
<title>An MCDM approach to portfolio optimization</title>
<year>2004</year>
<DOI>10.1016/S0377-2217(02)00881-0</DOI>
<journal>European Journal of Operational Research</journal>
<edition>3</edition>
<volume>155</volume>
<pages>752-770</pages>
<authors>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Christian</fn>
<sn>Schwehm</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:alge:2004</citeid>
<title>Algebraic properties of location problems with one circular barrier</title>
<year>2004</year>
<DOI>10.1016/S0377-2217(02)00800-7</DOI>
<journal>European Journal of Operational Research</journal>
<volume>154</volume>
<pages>20-35</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>AbelHeilmann2004</citeid>
<title>The complete asymptotic expansion for Bernstein-Durrmeyer operators with Jacobi weights</title>
<year>2004</year>
<DOI>10.1007/s00009-004-0026-2</DOI>
<journal>Mediterranean Journal of Mathematics</journal>
<volume>1</volume>
<pages>487-499</pages>
<number>4</number>
<authors>
<person>
<fn>Ulrich</fn>
<sn>Abel</sn>
</person>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:unbi:2002</citeid>
<title>Unbiased approximation in multicriteria optimization</title>
<year>2003</year>
<DOI>10.1007/s001860200217</DOI>
<journal>Mathematical Methods of Operations Research</journal>
<volume>56</volume>
<pages>413-437</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Jørgen</fn>
<sn>Tind</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>Heilmann2003-2</citeid>
<title>Commutativity of Durrmeyer-type modifications of Meyer-König and Zeller and Baskakov-operators</title>
<year>2003</year>
<booktitle>Constructive Theory of Functions - Proceedings of the International Conference, Varna, Bulgaria, 2002</booktitle>
<publisher>Sofia: DARBA</publisher>
<editor>B. Bojanov et al.</editor>
<pages>295-301</pages>
<file_url>http://www.math.bas.bg/mathmod/Proceedings_CTF/CTF-2002/files_CTF-2002/P2-19-Heilmann.pdf</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann2003</citeid>
<title>Rodriguez-type representation for the eigenfunctions of Durrmeyer-type operators</title>
<year>2003</year>
<DOI>10.1007/BF03322916</DOI>
<journal>Results in Mathematics</journal>
<volume>44</volume>
<pages>97-105</pages>
<number>1-2</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann2003-1</citeid>
<title>Eigenfunctions of Durrmeyer-type modifications of Meyer-König and Zeller operators</title>
<year>2003</year>
<DOI>10.1016/j.jat.2003.09.006</DOI>
<journal>Journal of Approximation Theory</journal>
<volume>125</volume>
<pages>63-73</pages>
<number>1</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schandel02normbased</citeid>
<title>Norm-Based Approximation in Multicriteria Programming</title>
<year>2002</year>
<DOI>10.1016/S0898-1221(02)00204-3</DOI>
<journal>Computers and Mathematics with Applications</journal>
<volume>44</volume>
<pages>925-942</pages>
<authors>
<person>
<fn>Bernd</fn>
<sn>Schandl</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>dear:domi:2002</citeid>
<title>Dominating sets for rectilinear center location problems with polyhedral barriers</title>
<year>2002</year>
<DOI>10.1002/nav.10038</DOI>
<journal>Naval Research Logistics</journal>
<volume>49</volume>
<pages>647-665</pages>
<authors>
<person>
<fn>P.M.</fn>
<sn>Dearing</sn>
</person>
<person>
<fn>Horst W.</fn>
<sn>Hamacher</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>incollection</bibtype>
<citeid>drez:thew:2002</citeid>
<title>The Weber problem</title>
<year>2002</year>
<booktitle>Facility Location: Applications and Theory</booktitle>
<publisher>Springer-Verlag</publisher>
<editor>Drezner, Z. and Hamacher, H.W.</editor>
<pages>1-36</pages>
<file_url>http://web.tecnico.ulisboa.pt/mcasquilho/compute/_scicomp/_location/DreznerHamacher.pdf</file_url>
<authors>
<person>
<fn>Zvi</fn>
<sn>Drezner</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Anita</fn>
<sn>Schöbel</sn>
</person>
<person>
<fn>George O.</fn>
<sn>Wesolowsky</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>book</bibtype>
<citeid>klam:sing:2002</citeid>
<title>Single-Facility Location Problems with Barriers</title>
<year>2002</year>
<DOI>10.1007/b98843</DOI>
<publisher>Springer Series in Operations Research</publisher>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:abio:2002</citeid>
<title>A bi-objective median location problem with a line barrier</title>
<year>2002</year>
<DOI>10.1287/opre.50.4.670.2857</DOI>
<journal>Operations Research</journal>
<volume>50</volume>
<pages>670-679</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>scha:intr:2002</citeid>
<title>Introducing oblique norms into multiple criteria programming</title>
<year>2002</year>
<DOI>10.1023/A:1014021806919</DOI>
<journal>Journal of Global Optimization</journal>
<volume>23</volume>
<pages>81-97</pages>
<authors>
<person>
<fn>Bernd</fn>
<sn>Schandl</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>schandl01norm</citeid>
<title>Norm-Based Approximation in Bicriteria Programming</title>
<year>2001</year>
<DOI>10.1023/A:1011267305444</DOI>
<journal>Computational Optimization and Applications</journal>
<volume>20</volume>
<pages>23-42</pages>
<number>1</number>
<authors>
<person>
<fn>Bernd</fn>
<sn>Schandl</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:ared:2001</citeid>
<title>A reduction result for location problems with polyhedral barriers</title>
<year>2001</year>
<DOI>10.1016/S0377-2217(99)00399-9</DOI>
<journal>European Journal of Operational Research</journal>
<volume>130</volume>
<pages>486-497</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:plan:2001</citeid>
<title>Planar location problems with line barriers</title>
<year>2001</year>
<DOI>10.1080/02331930108844547</DOI>
<journal>Optimization</journal>
<volume>49</volume>
<pages>517-527</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:atim:2001</citeid>
<title>A time-dependent multiple criteria single-machine scheduling problem</title>
<year>2001</year>
<DOI>10.1016/S0377-2217(00)00286-1</DOI>
<journal>European Journal of Operational Research</journal>
<volume>135</volume>
<pages>17-26</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>scha:norm:2001-2</citeid>
<title>Norm-based approximation in convex multicriteria programming</title>
<year>2001</year>
<DOI>10.1007/978-3-642-56656-1_2</DOI>
<booktitle>Operations Research Proceedings 2000</booktitle>
<publisher>Springer-Verlag</publisher>
<editor>Fleischmann, B. and Lasch, R. and Derigs, U. and Domschke, W. and Rieder, U.</editor>
<pages>8-13</pages>
<authors>
<person>
<fn>Bernd</fn>
<sn>Schandl</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>hama_plan:2000</citeid>
<title>Planar Weber location problems with barriers and block norms</title>
<year>2000</year>
<DOI>Planar Weber location problems with barriers and block norms</DOI>
<journal>Annals of Operations Research</journal>
<volume>96</volume>
<pages>191-208</pages>
<authors>
<person>
<fn>Horst W.</fn>
<sn>Hamacher</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>klam:time:2000</citeid>
<title>Time-dependent capital budgeting with multiple criteria</title>
<year>2000</year>
<DOI>10.1007/978-3-642-57311-8_36</DOI>
<booktitle>Research and Practice in Multiple Criteria Decision Making</booktitle>
<volume>487</volume>
<publisher>Springer-Verlag</publisher>
<series>Lecture Notes in Economics and Mathematical Systems</series>
<editor>Haimes, Y.Y. and Steuer, R.E.</editor>
<pages>421-432</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:dyna:2000</citeid>
<title>Dynamic programming approaches to the multiple criteria knapsack problem</title>
<year>2000</year>
<DOI>10.1002/(SICI)1520-6750(200002)47%3A1<57%3A%3AAID-NAV4>3.0.CO%3B2-4</DOI>
<journal>Naval Research Logistics</journal>
<volume>47</volume>
<pages>57-76</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>scha:usin:2000</citeid>
<title>Using block norms in bicriteria optimization</title>
<year>2000</year>
<DOI>10.1007/978-3-642-57311-8_12</DOI>
<booktitle>Research and Practice in Multiple Criteria Decision Making</booktitle>
<volume>487</volume>
<publisher>Springer-Verlag</publisher>
<series>Lecture Notes in Economics and Mathematical Systems</series>
<editor>Haimes, Y.Y. and Steuer, R.E.</editor>
<pages>149-160</pages>
<authors>
<person>
<fn>Bernd</fn>
<sn>Schandl</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>ehrgott97connectedness</citeid>
<title>Connectedness of efficient solutions in multiple criteria combinatorial optimization</title>
<year>1997</year>
<DOI>10.1016/S0377-2217(96)00116-6</DOI>
<journal>European Journal of Operational Research</journal>
<volume>97</volume>
<pages>159-166</pages>
<authors>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>ehrg:anot:1997</citeid>
<title>A note on the equivalence of balance points and Pareto solutions in multiple objective programming</title>
<year>1997</year>
<journal>Journal of Optimization Theory and Applications</journal>
<volume>92</volume>
<pages>209-212</pages>
<file_url>http://www2.math.uni-wuppertal.de/~klamroth/publications/news97.pdf</file_url>
<authors>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>Horst W.</fn>
<sn>Hamacher</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Nickel</sn>
</person>
<person>
<fn>Anita</fn>
<sn>Schöbel</sn>
</person>
<person>
<fn>Margaret M.</fn>
<sn>Wiecek</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>inproceedings</bibtype>
<citeid>ehrg:nonc:1997</citeid>
<title>Nonconnected efficiency graphs in multiple criteria combinatorial optimization</title>
<year>1997</year>
<DOI>10.1007/978-3-642-46854-4_15</DOI>
<booktitle>Advances in Multiple Objective and Goal Programming</booktitle>
<volume>455</volume>
<series>Lecture Notes in Economics and Mathematical Systems</series>
<editor>Caballero, R. and Ruiz, F. and Steuer, R.E.</editor>
<pages>140-150</pages>
<authors>
<person>
<fn>Matthias</fn>
<sn>Ehrgott</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:ther:1997</citeid>
<title>The Ramsey number r(K_1,3,C_4,K_4)</title>
<year>1997</year>
<journal>Utilitas Mathematica</journal>
<volume>52</volume>
<pages>65-81</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Ingrid</fn>
<sn>Mengersen</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>arst:thre:1996</citeid>
<title>Three color Ramsey numbers for small graphs</title>
<year>1996</year>
<journal>Utilitas Mathematica</journal>
<volume>49</volume>
<pages>85--96</pages>
<file_url>https://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p47/4525</file_url>
<authors>
<person>
<fn>J.</fn>
<sn>Arste</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Ingrid</fn>
<sn>Mengersen</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>klam:rams:1996</citeid>
<title>Ramsey numbers of K_3 versus (p,q)-graphs</title>
<year>1996</year>
<journal>Ars Combinatoria</journal>
<volume>43</volume>
<pages>107-120</pages>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Ingrid</fn>
<sn>Mengersen</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>proceedings</bibtype>
<citeid>hama:ewgl:1996</citeid>
<title>EWGLA 8 Proceedings</title>
<year>1996</year>
<volume>10</volume>
<series>Special Issue of Studies in Locational Analysis</series>
<authors>
<person>
<fn>Horst W.</fn>
<sn>Hamacher</sn>
</person>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
<person>
<fn>Stefan</fn>
<sn>Nickel</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann1995</citeid>
<title>Saturation of linear combinations of Baskakov-Durrmeyer-type operators</title>
<year>1995</year>
<DOI>10.1080/00036819508840392</DOI>
<journal>Applicable Analysis</journal>
<volume>59</volume>
<pages>93-107</pages>
<number>1-4</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann1995-1</citeid>
<title>Explicit Voronovskaja-type results for linear combinations of BDT-operators</title>
<year>1995</year>
<DOI>10.1007/BF02836445</DOI>
<journal>Approximation Theory and its Applications</journal>
<volume>11</volume>
<pages>54-61</pages>
<number>1</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>klam:rams:1994</citeid>
<title>Ramsey-Zahlen für Mengen von Graphen</title>
<year>1994</year>
<school>Technical University of Braunschweig</school>
<authors>
<person>
<fn>Kathrin</fn>
<sn>Klamroth</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>Heilmann1992</citeid>
<title>Rate of approximation of weighted derivatives by linear combinations of SMD-operators</title>
<year>1992</year>
<DOI>10.1007/978-3-0348-8619-2_6</DOI>
<booktitle>Numerical Methods in Approximation Theory - Proceedings of the conference held in Oberwolfach Germany, November 24-30, 1991</booktitle>
<publisher>Birkhäuser, Basel, Int. Ser. Numer. Math. 105</publisher>
<editor>D. Braess et al.</editor>
<pages>97-115</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>Heilmann1992-1</citeid>
<title>Erhöhung der Konvergenzgeschwindigkeit bei der Approximation von Funktionen mit Hilfe von Linearkombinationen spezieller positiver linearer Operatoren</title>
<year>1992</year>
<school>Universität Dortmund</school>
<file_url>https://www.researchgate.net/profile/Margareta-Heilmann</file_url>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>book</bibtype>
<citeid>HeilmannMueller1991</citeid>
<title>Equivalence of a weighted modulus of smoothness and a modified weighted K-functional</title>
<year>1991</year>
<booktitle>Progress in Approximation Theory</booktitle>
<publisher>Academic Press</publisher>
<editor>Nevai, P. and Pinkus, A.</editor>
<pages>467-473</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Manfred</fn>
<sn>Müller</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannMueller1990</citeid>
<title>Direct and converse results on simultaneous approximation by the method of Bernstein-Durrmeyer operators</title>
<year>1990</year>
<DOI>10.1007/978-1-4899-3442-0_11</DOI>
<booktitle>Algorithms for approximation II, Proc. 2nd Int. Conf., Shrivenham/UK 1988</booktitle>
<pages>107-116</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Manfred</fn>
<sn>Müller</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann1989</citeid>
<title>On simultaneous approximation by optimal algebraic polynomials</title>
<year>1989</year>
<DOI>10.1007/BF03322645</DOI>
<journal>Results in Mathematics</journal>
<volume>16</volume>
<pages>77-81</pages>
<number>1-2</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>Heilmann1989-1</citeid>
<title>Direct and converse results for operators of Baskakov-Durrmeyer type</title>
<year>1989</year>
<DOI>10.1007/BF02836120</DOI>
<journal>Approximation Theory Appl.</journal>
<volume>5</volume>
<pages>105-127</pages>
<number>1</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>HeilmannMueller1989</citeid>
<title>Weighted simultaneous L_p-approximation by the method of Baskakov-Durrmeyer operators</title>
<year>1989</year>
<DOI>10.1007/s10474-011-0135-x</DOI>
<booktitle>Approximation Theory VI, Proc. 6th Int. Symp., College Station/TX USA1989</booktitle>
<volume>1</volume>
<pages>331-332</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Manfred</fn>
<sn>Müller</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannMueller1989-1</citeid>
<title>Direct and converse results on weighted simultaneous approximation by the method of operators of Baskakov-Durrmeyer type</title>
<year>1989</year>
<DOI>10.1007/BF03322474</DOI>
<journal>Results in Mathematics</journal>
<volume>16</volume>
<pages>228-242</pages>
<number>3-4</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Manfred</fn>
<sn>Müller</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HeilmannMueller1989-2</citeid>
<title>On simultaneous approximation by the method of Baskakov-Durrmeyer operators</title>
<year>1989</year>
<DOI>10.1080/01630568908816295</DOI>
<journal>Numerical Functional Analysis and Optimization</journal>
<volume>10</volume>
<pages>127-138</pages>
<number>1-2</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
<person>
<fn>Manfred</fn>
<sn>Müller</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>article</bibtype>
<citeid>HEILMANN1988260</citeid>
<title>Lp-saturation of some modified Bernstein operators</title>
<year>1988</year>
<issn>0021-9045</issn>
<DOI>10.1016/0021-9045(88)90003-2</DOI>
<journal>Journal of Approximation Theory</journal>
<volume>54</volume>
<pages>260-273</pages>
<number>3</number>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>conference</bibtype>
<citeid>Heilmann1988</citeid>
<title>Commutativity of operators from Baskakov-Durrmeyer type</title>
<year>1988</year>
<booktitle>Constructive Theory of Functions - Proceedings of the International Conference, Varna, Bulgaria, 1987</booktitle>
<pages>197-206</pages>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
<reference>
<bibtype>phdthesis</bibtype>
<citeid>Heilmann1987</citeid>
<title>Approximation auf [0, ∞) durch das Verfahren der Operatoren vom Baskakov-Durrmeyer Typ</title>
<year>1987</year>
<school>Universität Dortmund</school>
<authors>
<person>
<fn>Margareta</fn>
<sn>Heilmann</sn>
</person>
</authors>
</reference>
</bib>
