Learning to Choose Branching Rules for Nonconvex MINLPs

Timo Berthold, Fritz Geis

Outer-approximation-based branch-and-bound is a common algorithmic framework for solving MINLPs (mixed-integer nonlinear programs) to global optimality, with branching variable sel…