8 citations · 17 across the 13 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.OC2026
Decision-Tree Surrogates for Weak Counterfactual Explanations in Integer Optimization
Marc Goerigk, Jannis Kurtz, Sebastian Merten
The concept of counterfactual explanations (CEs) has recently gained increasing attention for deriving explanations of mathematical optimization problems. For a given problem, a co…
math.OC2026
The complexity landscape of robust (integer) linear programming
Michael Poss, Jannis Kurtz, Marc Goerigk +1
We study the computational complexity of the decision versions of three classic robust optimization problems: static robust optimization, two-stage (adjustable) robust optimization…
math.OC2026
Globalized Adversarial Regret Optimization: Robust Decisions with Uncalibrated Predictions
Jannis Kurtz, Bart P. G. van Parys
Optimization problems routinely depend on uncertain parameters that must be predicted before a decision is made. Classical robust and regret formulations are designed to handle err…