Kathrin Klamroth

Orcid: 0000-0001-9119-0732

Affiliations:
  • Bergische Universität Wuppertal, Germany


According to our database1, Kathrin Klamroth authored at least 81 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient dominance filtering for unions and Minkowski sums of non-dominated sets.
Comput. Oper. Res., March, 2024

Solving the Multiobjective Quasi-Clique Problem.
CoRR, 2024

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems.
CoRR, 2024

2023
Ordinal optimization through multi-objective reformulation.
Eur. J. Oper. Res., December, 2023

PINN training using biobjective optimization: The trade-off between data loss and residual loss.
J. Comput. Phys., September, 2023

Multi-objective matroid optimization with ordinal weights.
Discret. Appl. Math., August, 2023

Constructing Optimal L<sub>∞</sub> Star Discrepancy Sets.
CoRR, 2023

A Tight Formulation for the Dial-a-Ride Problem.
CoRR, 2023

On the online path extension problem - Location and routing problems in board games.
CoRR, 2023

Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems.
CoRR, 2023

Non-convex shape optimization by dissipative Hamiltonian flows.
CoRR, 2023

Ridepooling and public bus services: A comparative case-study.
CoRR, 2023

2022
Event-based MILP models for ridepooling applications.
Eur. J. Oper. Res., 2022

Efficient and sparse neural networks by pruning weights in a multiobjective learning approach.
Comput. Oper. Res., 2022

Branch-and-bound and objective branching with three or more objectives.
Comput. Oper. Res., 2022

Decision space robustness for multi-objective integer linear programming.
Ann. Oper. Res., 2022

2021
Tracing Locally Pareto-Optimal Points by Numerical Integration.
SIAM J. Control. Optim., 2021

Nonconvex constrained optimization by a filtering branch and bound.
J. Glob. Optim., 2021

A local analysis to determine all optimal solutions of p-k-max location problems on networks.
Discret. Appl. Math., 2021

Biobjective Optimization Problems on Matroids with Binary Costs.
CoRR, 2021

Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Introducing multiobjective complex systems.
Eur. J. Oper. Res., 2020

Scalability in Multiobjective Optimization (Dagstuhl Seminar 20031).
Dagstuhl Reports, 2020

Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach.
CoRR, 2020

GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks.
CoRR, 2020

2019
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions.
J. Glob. Optim., 2019

Exact algorithms for handling outliers in center location problems on networks using <i>k</i>-max functions.
Eur. J. Oper. Res., 2019

Interactive Nonconvex Pareto Navigator for multiobjective optimization.
Eur. J. Oper. Res., 2019

A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs.
CoRR, 2019

Combining Traveling Salesman and Traveling Repairman Problems: A multi-objective approach based on multiple scenarios.
Comput. Oper. Res., 2019

2018
Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031).
Dagstuhl Reports, 2018

Assigning Students to Schools for an Internship.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
A unified approach to uncertain optimization.
Eur. J. Oper. Res., 2017

Efficient computation of the search region in multi-objective optimization.
Eur. J. Oper. Res., 2017

Bi-dimensional knapsack problems with one soft constraint.
Comput. Oper. Res., 2017

A box decomposition algorithm to compute the hypervolume indicator.
Comput. Oper. Res., 2017

2015
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems.
J. Glob. Optim., 2015

On the representation of the search region in multi-objective optimization.
Eur. J. Oper. Res., 2015

Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031).
Dagstuhl Reports, 2015

Representation of the non-dominated set in biobjective discrete optimization.
Comput. Oper. Res., 2015

2014
On the multicriteria allocation problem.
Ann. Oper. Res., 2014

2013
On a biobjective search problem in a line: Formulations and algorithms.
Theor. Comput. Sci., 2013

Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions.
J. Sched., 2013

Multicriteria 0-1 knapsack problems with k-min objectives.
Comput. Oper. Res., 2013

2012
Generalized multiple objective bottleneck problems.
Oper. Res. Lett., 2012

An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems.
Comput. Oper. Res., 2012

Discrete and geometric Branch and Bound algorithms for medical image registration.
Ann. Oper. Res., 2012

Dynamic programming based algorithms for the discounted {0-1} knapsack problem.
Appl. Math. Comput., 2012

Dynamic Programming for a Biobjective Search Problem in a Line.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization.
J. Optim. Theory Appl., 2011

2010
Pareto navigator for interactive nonlinear multiobjective optimization.
OR Spectr., 2010

Optimizing the number of multigrid cycles in the full multigrid algorithm.
Numer. Linear Algebra Appl., 2010

2009
On the Application of the Monge--Kantorovich Problem to Image Registration.
SIAM J. Imaging Sci., 2009

The multi-facility location-allocation problem with polyhedral barriers.
Comput. Oper. Res., 2009

Discrete Multiobjective Optimization.
Proceedings of the Evolutionary Multi-Criterion Optimization, 5th International Conference, 2009

09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round).
Proceedings of the Hybrid and Robust Approaches to Multiobjective Optimization, 18.01., 2009

2008
Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications.
Math. Methods Oper. Res., 2008

Registration of PE segment contour deformations in digital high-speed videos.
Medical Image Anal., 2008

Integrating Approximation and Interactive Decision Making in Multicriteria Optimization.
Oper. Res., 2008

A unified model for Weber problems with continuous and network distances.
Comput. Oper. Res., 2008

New trends in locational analysis.
Comput. Oper. Res., 2008

A Branch & Bound Algorithm for Medical Image Registration.
Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008

2007
Biconvex sets and optimization with biconvex functions: a survey and extensions.
Math. Methods Oper. Res., 2007

Constrained optimization using multiple objective programming.
J. Glob. Optim., 2007

An efficient solution method for Weber problems with barriers based on genetic algorithms.
Eur. J. Oper. Res., 2007

2005
The <i>K</i> -Connection Location Problem in a Plane.
Ann. Oper. Res., 2005

A Wavefront Approach to Center Location Problems with Barriers.
Ann. Oper. Res., 2005

Planar Location Problems with Block Distance and Barriers.
Ann. Oper. Res., 2005

2004
Integer Programming Duality in Multiple Objective Programming.
J. Glob. Optim., 2004

Algebraic properties of location problems with one circular barrier.
Eur. J. Oper. Res., 2004

An MCDM approach to portfolio optimization.
Eur. J. Oper. Res., 2004

2003
Unbiased approximation in multicriteria optimization.
Math. Methods Oper. Res., 2003

2002
Introducing oblique norms into multiple criteria programming.
J. Glob. Optim., 2002

A Bi-Objective Median Location ProblemWith a Line Barrier.
Oper. Res., 2002

Single-facility location problems with barriers.
Springer series in operations research, Springer, ISBN: 978-0-387-95498-1, 2002

2001
A time-dependent multiple criteria single-machine scheduling problem.
Eur. J. Oper. Res., 2001

A reduction result for location problems with polyhedral barriers.
Eur. J. Oper. Res., 2001

Norm-Based Approximation in Bicriteria Programming.
Comput. Optim. Appl., 2001

2000
Planar Weber location problems with barriers and block norms.
Ann. Oper. Res., 2000

Lineare und Netzwerk-Optimierung - ein bilinguales Lehrbuch: a bilingual textbook.
Vieweg, ISBN: 978-3-528-03155-8, 2000

1996
Ramsey numbers of K3 versus (p, q)-graphs.
Ars Comb., 1996


  Loading...