Old Web
English
Sign In
Acemap
>
Paper
>
Mining Pareto-Optimal Counterfactual Antecedents With A Branch-And-Bound Model-Agnostic Algorithm
Mining Pareto-Optimal Counterfactual Antecedents With A Branch-And-Bound Model-Agnostic Algorithm
2021
Marcos M. M. Raimundo
Luis Gustavo Nonato
Jorge Poco
Keywords:
Mathematical optimization
Counterfactual thinking
Computer science
Branch and bound
pareto optimal
Correction
Source
Cite
Save
Machine Reading By IdeaReader
1
References
0
Citations
NaN
KQI
[]