![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kathrin Klamroth
Person information
- affiliation: Bergische Universität Wuppertal, Germany
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j59]Kathrin Klamroth
, Bruno Lang
, Michael Stiglmayr
:
Efficient dominance filtering for unions and Minkowski sums of non-dominated sets. Comput. Oper. Res. 163: 106506 (2024) - [j58]Kathrin Klamroth
, Michael Stiglmayr
, Claudia Totzeck
:
Consensus-based optimization for multi-objective problems: a multi-swarm approach. J. Glob. Optim. 89(3): 745-776 (2024) - [i21]Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete:
Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems. CoRR abs/2403.08534 (2024) - [i20]Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete:
Solving the Multiobjective Quasi-Clique Problem. CoRR abs/2403.10896 (2024) - 2023
- [j57]Kathrin Klamroth
, Michael Stiglmayr
, Julia Sudhoff
:
Multi-objective matroid optimization with ordinal weights. Discret. Appl. Math. 335: 104-119 (2023) - [j56]Kathrin Klamroth
, Michael Stiglmayr
, Julia Sudhoff
:
Ordinal optimization through multi-objective reformulation. Eur. J. Oper. Res. 311(2): 427-443 (2023) - [j55]Fabian Heldmann, Sarah Berkhahn
, Matthias Ehrhardt
, Kathrin Klamroth
:
PINN training using biobjective optimization: The trade-off between data loss and residual loss. J. Comput. Phys. 488: 112211 (2023) - [p1]Andreia P. Guerreiro, Kathrin Klamroth
, Carlos M. Fonseca:
Theoretical Aspects of Subset Selection in Multi-Objective Optimisation. Many-Criteria Optimization and Decision Analysis 2023: 213-239 - [i19]Hayk Asatryan, Daniela Gaul, Hanno Gottschalk, Kathrin Klamroth, Michael Stiglmayr:
Ridepooling and public bus services: A comparative case-study. CoRR abs/2302.01709 (2023) - [i18]Fabian Heldmann, Sarah Berkhahn, Matthias Ehrhardt
, Kathrin Klamroth:
PINN Training using Biobjective Optimization: The Trade-off between Data Loss and Residual Loss. CoRR abs/2302.01810 (2023) - [i17]Matthias Bolten, Onur Tanil Doganay, Hanno Gottschalk, Kathrin Klamroth:
Non-convex shape optimization by dissipative Hamiltonian flows. CoRR abs/2303.01369 (2023) - [i16]Onur Tanil Doganay, Kathrin Klamroth, Bruno Lang, Michael Stiglmayr, Claudia Totzeck:
Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems. CoRR abs/2303.15082 (2023) - [i15]Konstantin Kraus, Kathrin Klamroth, Michael Stiglmayr:
On the online path extension problem - Location and routing problems in board games. CoRR abs/2305.12898 (2023) - [i14]Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer, Arne Schulz
, Michael Stiglmayr:
A Tight Formulation for the Dial-a-Ride Problem. CoRR abs/2308.11285 (2023) - [i13]François Clément, Carola Doerr, Kathrin Klamroth, Luís Paquete:
Constructing Optimal L∞ Star Discrepancy Sets. CoRR abs/2311.17463 (2023) - 2022
- [j54]Michael Stiglmayr
, José Rui Figueira
, Kathrin Klamroth
, Luís Paquete
, Britta Schulze
:
Decision space robustness for multi-objective integer linear programming. Ann. Oper. Res. 319(2): 1769-1791 (2022) - [j53]Malena Reiners, Kathrin Klamroth
, Fabian Heldmann, Michael Stiglmayr
:
Efficient and sparse neural networks by pruning weights in a multiobjective learning approach. Comput. Oper. Res. 141: 105676 (2022) - [j52]Nicolas Forget
, Sune Lauth Gadegaard
, Kathrin Klamroth
, Lars Relund Nielsen
, Anthony Przybylski:
Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148: 106012 (2022) - [j51]Daniela Gaul
, Kathrin Klamroth
, Michael Stiglmayr
:
Event-based MILP models for ridepooling applications. Eur. J. Oper. Res. 301(3): 1048-1063 (2022) - 2021
- [j50]Teresa Schnepper, Kathrin Klamroth
, Justo Puerto
, Michael Stiglmayr
:
A local analysis to determine all optimal solutions of p-k-max location problems on networks. Discret. Appl. Math. 296: 217-234 (2021) - [j49]Gabriele Eichfelder
, Kathrin Klamroth
, Julia Niebling
:
Nonconvex constrained optimization by a filtering branch and bound. J. Glob. Optim. 80(1): 31-61 (2021) - [j48]Matthias Bolten
, Onur Tanil Doganay, Hanno Gottschalk
, Kathrin Klamroth
:
Tracing Locally Pareto-Optimal Points by Numerical Integration. SIAM J. Control. Optim. 59(5): 3302-3328 (2021) - [c5]Daniela Gaul
, Kathrin Klamroth
, Michael Stiglmayr
:
Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. ATMOS 2021: 8:1-8:16 - [i12]Jochen Gorski, Kathrin Klamroth, Julia Sudhoff:
Biobjective Optimization Problems on Matroids with Binary Costs. CoRR abs/2108.00709 (2021) - 2020
- [j47]Tobias Dietz, Kathrin Klamroth
, Konstantin Kraus, Stefan Ruzika, Luca E. Schäfer
, Britta Schulze, Michael Stiglmayr
, Margaret M. Wiecek:
Introducing multiobjective complex systems. Eur. J. Oper. Res. 280(2): 581-596 (2020) - [i11]Jan Backhaus, Matthias Bolten, Onur Tanil Doganay, Matthias Ehrhardt, Benedikt Engel, Christian Frey, Hanno Gottschalk, Michael Günther, Camilla Hahn, Jens Jäschke
, Peter Jaksch, Kathrin Klamroth, Alexander Liefke, Daniel Luft, Lucas Mäde, Vincent Marciniak, Marco Reese, Johanna Schultes, Volker Schulz, Sebastian Schmitz, Johannes Steiner, Michael Stiglmayr
:
GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks. CoRR abs/2002.08672 (2020) - [i10]Matthias Bolten, Onur Tanil Doganay, Hanno Gottschalk, Kathrin Klamroth:
Tracing locally Pareto optimal points by numerical integration. CoRR abs/2004.10820 (2020) - [i9]Malena Reiners, Kathrin Klamroth, Michael Stiglmayr:
Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach. CoRR abs/2008.13590 (2020) - [i8]Carlos M. Fonseca, Kathrin Klamroth
, Günter Rudolph, Margaret M. Wiecek:
Scalability in Multiobjective Optimization (Dagstuhl Seminar 20031). Dagstuhl Reports 10(1): 52-129 (2020)
2010 – 2019
- 2019
- [j46]Stefan Bock
, Kathrin Klamroth
:
Combining Traveling Salesman and Traveling Repairman Problems: A multi-objective approach based on multiple scenarios. Comput. Oper. Res. 112 (2019) - [j45]Teresa Schnepper, Kathrin Klamroth
, Michael Stiglmayr, Justo Puerto
:
Exact algorithms for handling outliers in center location problems on networks using k-max functions. Eur. J. Oper. Res. 273(2): 441-451 (2019) - [j44]Markus Hartikainen, Kaisa Miettinen
, Kathrin Klamroth
:
Interactive Nonconvex Pareto Navigator for multiobjective optimization. Eur. J. Oper. Res. 275(1): 238-251 (2019) - [j43]Britta Schulze
, Kathrin Klamroth
, Michael Stiglmayr
:
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions. J. Glob. Optim. 74(3): 495-522 (2019) - [e2]Kalyanmoy Deb, Erik D. Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, Patrick M. Reed:
Evolutionary Multi-Criterion Optimization - 10th International Conference, EMO 2019, East Lansing, MI, USA, March 10-13, 2019, Proceedings. Lecture Notes in Computer Science 11411, Springer 2019, ISBN 978-3-030-12597-4 [contents] - [i7]Anthony Przybylski, Kathrin Klamroth, Renaud Lacour:
A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs. CoRR abs/1911.08937 (2019) - 2018
- [c4]Michael Stiglmayr, Simon Görtz, Kathrin Klamroth
:
Assigning Students to Schools for an Internship. OR 2018: 151-157 - [i6]Kathrin Klamroth
, Joshua D. Knowles, Günter Rudolph, Margaret M. Wiecek:
Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031). Dagstuhl Reports 8(1): 33-99 (2018) - 2017
- [j42]Britta Schulze, Luís Paquete
, Kathrin Klamroth
, José Rui Figueira
:
Bi-dimensional knapsack problems with one soft constraint. Comput. Oper. Res. 78: 15-26 (2017) - [j41]Renaud Lacour, Kathrin Klamroth
, Carlos M. Fonseca
:
A box decomposition algorithm to compute the hypervolume indicator. Comput. Oper. Res. 79: 347-360 (2017) - [j40]Kathrin Klamroth
, Elisabeth Köbis, Anita Schöbel, Christiane Tammer:
A unified approach to uncertain optimization. Eur. J. Oper. Res. 260(2): 403-420 (2017) - [j39]Kerstin Dächert, Kathrin Klamroth
, Renaud Lacour
, Daniel Vanderpooten
:
Efficient computation of the search region in multi-objective optimization. Eur. J. Oper. Res. 260(3): 841-855 (2017) - [e1]Heike Trautmann, Günter Rudolph, Kathrin Klamroth, Oliver Schütze, Margaret M. Wiecek, Yaochu Jin, Christian Grimme:
Evolutionary Multi-Criterion Optimization - 9th International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings. Lecture Notes in Computer Science 10173, Springer 2017, ISBN 978-3-319-54156-3 [contents] - 2015
- [j38]Daniel Vaz
, Luís Paquete
, Carlos M. Fonseca
, Kathrin Klamroth
, Michael Stiglmayr
:
Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63: 172-186 (2015) - [j37]Kathrin Klamroth
, Renaud Lacour
, Daniel Vanderpooten
:
On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3): 767-778 (2015) - [j36]Kerstin Dächert, Kathrin Klamroth
:
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Glob. Optim. 61(4): 643-676 (2015) - [i5]Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten:
On the representation of the search region in multi-objective optimization. CoRR abs/1502.06111 (2015) - [i4]Renaud Lacour, Kathrin Klamroth, Carlos M. Fonseca:
A Box Decomposition Algorithm to Compute the Hypervolume Indicator. CoRR abs/1510.01963 (2015) - [i3]Salvatore Greco, Kathrin Klamroth
, Joshua D. Knowles
, Günter Rudolph:
Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031). Dagstuhl Reports 5(1): 96-163 (2015) - 2014
- [j35]Michael Stiglmayr
, José Rui Figueira
, Kathrin Klamroth
:
On the multicriteria allocation problem. Ann. Oper. Res. 222(1): 535-549 (2014) - 2013
- [j34]Aiying Rong
, Kathrin Klamroth
, José Rui Figueira
:
Multicriteria 0-1 knapsack problems with k-min objectives. Comput. Oper. Res. 40(5): 1481-1496 (2013) - [j33]Stefan Bock
, Kathrin Klamroth
:
Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions. J. Sched. 16(5): 479-494 (2013) - [j32]Luís Paquete
, Mathias Jaschob, Kathrin Klamroth
, Jochen Gorski:
On a biobjective search problem in a line: Formulations and algorithms. Theor. Comput. Sci. 507: 61-71 (2013) - [i2]Kerstin Dächert, Kathrin Klamroth:
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. CoRR abs/1305.5266 (2013) - 2012
- [j31]Aiying Rong
, José Rui Figueira
, Kathrin Klamroth
:
Dynamic programming based algorithms for the discounted {0-1} knapsack problem. Appl. Math. Comput. 218(12): 6921-6933 (2012) - [j30]Frank Pfeuffer, Michael Stiglmayr
, Kathrin Klamroth
:
Discrete and geometric Branch and Bound algorithms for medical image registration. Ann. Oper. Res. 196(1): 737-765 (2012) - [j29]Kerstin Dächert, Jochen Gorski, Kathrin Klamroth
:
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems. Comput. Oper. Res. 39(12): 2929-2943 (2012) - [j28]Jochen Gorski, Kathrin Klamroth
, Stefan Ruzika:
Generalized multiple objective bottleneck problems. Oper. Res. Lett. 40(4): 276-281 (2012) - [c3]Luís Paquete
, Mathias Jaschob, Kathrin Klamroth
, Jochen Gorski:
Dynamic Programming for a Biobjective Search Problem in a Line. COCOA 2012: 348-359 - 2011
- [j27]Jochen Gorski, Kathrin Klamroth
, Stefan Ruzika:
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization. J. Optim. Theory Appl. 150(3): 475-497 (2011) - 2010
- [j26]Alexander Thekale, Tobias Gradl, Kathrin Klamroth
, Ulrich Rüde
:
Optimizing the number of multigrid cycles in the full multigrid algorithm. Numer. Linear Algebra Appl. 17(2-3): 199-210 (2010) - [j25]Petri Eskelinen, Kaisa Miettinen
, Kathrin Klamroth
, Jussi Hakanen:
Pareto navigator for interactive nonlinear multiobjective optimization. OR Spectr. 32(1): 211-227 (2010)
2000 – 2009
- 2009
- [j24]Martin Bischoff, Tina Fleischmann, Kathrin Klamroth
:
The multi-facility location-allocation problem with polyhedral barriers. Comput. Oper. Res. 36(5): 1376-1392 (2009) - [j23]O. Museyko, Michael Stiglmayr
, Kathrin Klamroth
, Günter Leugering:
On the Application of the Monge--Kantorovich Problem to Image Registration. SIAM J. Imaging Sci. 2(4): 1068-1097 (2009) - [c2]Kathrin Klamroth:
Discrete Multiobjective Optimization. EMO 2009: 4 - [i1]José Rui Figueira, Martin Geiger, Salvatore Greco, Johannes Jahn, Kathrin Klamroth, Masahiro Inuiguchi, Vincent Mousseau, Serpil Sayin, Roman Slowinski, Margaret M. Wiecek, Katrin Witting:
09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round). Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j22]Barbara Pfeiffer, Kathrin Klamroth
:
A unified model for Weber problems with continuous and network distances. Comput. Oper. Res. 35(2): 312-326 (2008) - [j21]S. Arifusalem, Stefano Benati
, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics
, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín
, Juan A. Mesa, Malick M. Ndiaye
, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [j20]Kathrin Klamroth
, Kaisa Miettinen
:
Integrating Approximation and Interactive Decision Making in Multicriteria Optimization. Oper. Res. 56(1): 222-234 (2008) - [j19]Michael Stiglmayr
, Raphael Schwarz, Kathrin Klamroth
, Günter Leugering
, Jörg Lohscheller:
Registration of PE segment contour deformations in digital high-speed videos. Medical Image Anal. 12(3): 318-334 (2008) - [j18]Mirjam Dür, Petra Huhn, Kathrin Klamroth, Christiane Tammer:
Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications. Math. Methods Oper. Res. 68(2): 207-210 (2008) - [c1]Michael Stiglmayr, Frank Pfeuffer, Kathrin Klamroth
:
A Branch & Bound Algorithm for Medical Image Registration. IWCIA 2008: 217-228 - 2007
- [j17]Martin Bischoff, Kathrin Klamroth
:
An efficient solution method for Weber problems with barriers based on genetic algorithms. Eur. J. Oper. Res. 177(1): 22-41 (2007) - [j16]Kathrin Klamroth
, Jørgen Tind:
Constrained optimization using multiple objective programming. J. Glob. Optim. 37(3): 325-355 (2007) - [j15]Jochen Gorski, Frank Pfeuffer, Kathrin Klamroth
:
Biconvex sets and optimization with biconvex functions: a survey and extensions. Math. Methods Oper. Res. 66(3): 373-407 (2007) - 2005
- [j14]L. Frießs, Kathrin Klamroth
, M. Sprau:
A Wavefront Approach to Center Location Problems with Barriers. Ann. Oper. Res. 136(1): 35-48 (2005) - [j13]Perino M. Dearing, Kathrin Klamroth
, Roy Segars Jr.:
Planar Location Problems with Block Distance and Barriers. Ann. Oper. Res. 136(1): 117-143 (2005) - [j12]Simin Huang, Rajan Batta, Kathrin Klamroth
, Rakesh Nagi
:
The K -Connection Location Problem in a Plane. Ann. Oper. Res. 136(1): 193-209 (2005) - 2004
- [j11]Kathrin Klamroth
:
Algebraic properties of location problems with one circular barrier. Eur. J. Oper. Res. 154(1): 20-35 (2004) - [j10]Matthias Ehrgott, Kathrin Klamroth
, Christian Schwehm:
An MCDM approach to portfolio optimization. Eur. J. Oper. Res. 155(3): 752-770 (2004) - [j9]Kathrin Klamroth
, Jørgen Tind, Sibylle Zust:
Integer Programming Duality in Multiple Objective Programming. J. Glob. Optim. 29(1): 1-18 (2004) - 2003
- [j8]Kathrin Klamroth
, Jørgen Tind, Margaret M. Wiecek:
Unbiased approximation in multicriteria optimization. Math. Methods Oper. Res. 56(3): 413-437 (2003) - 2002
- [b2]Kathrin Klamroth:
Single-facility location problems with barriers. Springer series in operations research, Springer 2002, ISBN 978-0-387-95498-1, pp. I-XI, 1-201 - [j7]Kathrin Klamroth
, Margaret M. Wiecek:
A Bi-Objective Median Location ProblemWith a Line Barrier. Oper. Res. 50(4): 670-679 (2002) - [j6]Bernd Schandl, Kathrin Klamroth
, Margaret M. Wiecek:
Introducing oblique norms into multiple criteria programming. J. Glob. Optim. 23(1): 81-97 (2002) - 2001
- [j5]Bernd Schandl, Kathrin Klamroth, Margaret M. Wiecek:
Norm-Based Approximation in Bicriteria Programming. Comput. Optim. Appl. 20(1): 23-42 (2001) - [j4]Kathrin Klamroth
:
A reduction result for location problems with polyhedral barriers. Eur. J. Oper. Res. 130(3): 486-497 (2001) - [j3]Kathrin Klamroth
, Margaret M. Wiecek:
A time-dependent multiple criteria single-machine scheduling problem. Eur. J. Oper. Res. 135(1): 17-26 (2001) - 2000
- [b1]Horst W. Hamacher, Kathrin Klamroth:
Lineare und Netzwerk-Optimierung - ein bilinguales Lehrbuch: a bilingual textbook. Vieweg 2000, ISBN 978-3-528-03155-8, pp. 1-240 - [j2]Horst W. Hamacher, Kathrin Klamroth:
Planar Weber location problems with barriers and block norms. Ann. Oper. Res. 96(1-4): 191-208 (2000)
1990 – 1999
- 1996
- [j1]Kathrin Klamroth, Ingrid Mengersen:
Ramsey numbers of K3 versus (p, q)-graphs. Ars Comb. 43 (1996)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint