A framework for inherently interpretable optimization models
From MaRDI portal
Publication:6168581
DOI10.1016/j.ejor.2023.04.013arXiv2208.12570OpenAlexW4365814428MaRDI QIDQ6168581
Marc Goerigk, Michael Hartisch
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.12570
Cites Work
- Unnamed Item
- Supersparse linear integer models for optimized medical scoring systems
- Min-max-min robust combinatorial optimization
- Using arguments for making and explaining decisions
- Constructing optimal binary decision trees is NP-complete
- Explanation and argumentation capabilities: towards the creation of more persuasive agents
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty
- The decision rule approach to optimization under uncertainty: methodology and applications
- Interpretable clustering: an optimization approach
- \(K\)-adaptability in stochastic optimization
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
- Recent advances in selection hyper-heuristics
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Explanation in artificial intelligence: insights from the social sciences
- Finding multiple solutions to general integer linear programs
- Comprehensible credit scoring models using rule extraction from support vector machines
- K-Adaptability in Two-Stage Robust Binary Programming
- Finite Adaptability in Multistage Linear Optimization
- Explainable dynamic programming
- Optimal classification trees
This page was built for publication: A framework for inherently interpretable optimization models
