The computational utility of inductive linearizations for binary quadratic programs when combined with a mixed-integer programming solver is investigated for several combinatorial optimization problems and established benchmark instances.

Relaxation and Decomposition -- Simplifying via Reformulation, Approximation, and Relaxation -- Approximating and Relaxing Optimization Problems -- Learning-Assisted Relaxations and Approximations -- Solving Optimization Problems with Complicating Variables -- Solving Optimization Problems via...