LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs

Ivo Nowak & Stefan Vigerske
We present a Branch and Cut algorithm of the software package LaGO to solve nonconvex mixed-integer nonlinear programs. A linear outer approximation is constructed from a convex relaxation of the problem. Since we do not require an algebraic representation of the problem, reformulation techniques for the construction of the convex relaxation cannot be applied, and we are restricted to sampling techniques in case of nonquadratic nonconvex functions. The linear relaxation is further improved by mixed-integer-rounding...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.