3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.OC2022
Ordinal Optimization Through Multi-objective Reformulation
Kathrin Klamroth, Michael Stiglmayr, Julia Sudhoff
We analyze combinatorial optimization problems with ordinal, i.e., non-additive, objective functions that assign categories (like good, medium and bad) rather than cost coefficient…
cs.DS2021★ 3 cited
Biobjective Optimization Problems on Matroids with Binary Costs
Jochen Gorski, Kathrin Klamroth, Julia Sudhoff
Like most multiobjective combinatorial optimization problems, biobjective optimization problems on matroids are in general intractable and their corresponding decision problems are…