A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x
In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures
Bent, Rusell↗