Inductive linearization for binary quadratic programs with linear constraints: a computational study

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.

Automated summary

The computational usefulness of combining inductive linearizations with a mixed-integer programming solver for binary quadratic programs has been investigated in various combinatorial optimization problems and established benchmark instances.