2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.AI2020★ 2 cited
Computing Optimal Decision Sets with SAT
Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey +1
As machine learning is increasingly used to help make decisions, there is a demand for these decisions to be explainable. Arguably, the most explainable machine learning models use…
math.OC2019
Further Results on an Abstract Model for Branching and its Application to Mixed-Integer Programming
Daniel Anderson, Pierre Le Bodic, Kerri Morgan
A key ingredient in branch and bound (B&B) solvers for mixed-integer programming (MIP) is the selection of branching variables since poor or arbitrary selection can affect the size…