Objective-based counterfactual explanations for linear discrete optimization
From MaRDI portal
Publication:6057243
DOI10.1007/978-3-031-33271-5_2OpenAlexW4377231387MaRDI QIDQ6057243
Anton Korikov, J. Christopher Beck
Publication date: 4 October 2023
Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_2
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for the inverse mixed integer linear programming problem
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- Explanation in artificial intelligence: insights from the social sciences
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
This page was built for publication: Objective-based counterfactual explanations for linear discrete optimization
