Biggs, Max; Hariss, Rim; Perakis, Georgia - 2020
We study the problem of optimizing a tree-based ensemble objective with the feasible decisions lie in a polyhedral set. We model this optimization problem as a Mixed Integer Linear Program (MILP). We show this model can be solved to optimality efficiently using Pareto optimal Benders cuts. For...