Counterfactual explanations for linear optimization
Authors:
- Jannis KurtzJKJannis Kurtz
- Ş. İlKer BirbilŞBŞ. İlKer Birbil
- Dick Den HertogDHDick Den Hertog
Open Access
- 18 July 2025
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 329 (1) , 24-41
Abstract
No abstract availableAll Related Versions
This publication has 19 references indexed in Scilit:
- Counterfactual analysis and target setting in benchmarkingEuropean Journal of Operational Research, 2024
- A framework for inherently interpretable optimization modelsEuropean Journal of Operational Research, 2023
- On the Optimal Correction of Infeasible Systems of Linear InequalitiesJournal of Optimization Theory and Applications, 2021
- A Survey on Mixed-Integer Programming Techniques in Bilevel OptimizationEURO Journal on Computational Optimization, 2021
- The Nutritious Supply Chain: Optimizing Humanitarian Food AssistanceINFORMS Journal on Optimization, 2021
- Automatic repair of convex optimization problemsOptimization and Engineering, 2020
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable casesOptimization Letters, 2018
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problemJournal of Global Optimization, 2013
- Pessimistic Bilevel OptimizationSIAM Journal on Optimization, 2013
- A reformulation–linearization–convexification algorithm for optimal correction of an inconsistent system of linear constraintsComputers & Operations Research, 2008