Cutting plane selection is a subroutine used in all modern mixed-integer
linear programming solvers with the goal of selecting a subset of generated
cuts that induce optimal solver performance. These solvers have millions of
parameter combinations, and so are excellent candidates for <