3 papers
math.OC2026
Consistent Path Selection for Bi-objective Median Location Problems on Graphs
Renée Lamsfuß, Kathrin Klamroth, Michael Stiglmayr +1
We consider single-facility median location problems on graphs where two conflicting cost values are associated with the edges. As an example, suppose that a decision maker wants t…
math.OC2026
Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
Kathrin Klamroth, Michael Stiglmayr, Julia Sudhoff Santos
In combinatorial optimization, ordinal costs can be used to model the quality of elements whenever numerical values are not available. When considering, for example, routing proble…
cs.DM2024
On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
José Rui Figueira, Kathrin Klamroth, Michael Stiglmayr +1
Multi-objective unconstrained combinatorial optimization problems (MUCO) are in general hard to solve, i.e., the corresponding decision problem is NP-hard and the outcome set is in…