Objective-based counterfactual explanations for linear discrete optimization

DOI10.1007/978-3-031-33271-5_2MaRDI QIDQ6057243zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Cites work

• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Explanation in artificial intelligence: insights from the social sciences
• Heuristic algorithms for the inverse mixed integer linear programming problem
• scientific article; zbMATH DE number 5823945 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods

Cited in

(2)

• Counterfactual explanations for linear optimization
• Cost-minimal parameter correction subsets for unsatisfiable constraint problems

This page was built for publication: Objective-based counterfactual explanations for linear discrete optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057243)