Mixed-integer cuts or Cutting-plane methods is an iterative approach used to simplify the solution of a mixed
integer linear programming (MILP) problem. Cutting-plane methods work by first relaxing the MILP to a
complementary linear programming problem and cutting the feasible region to narrow down the solution search
space to only...