DOE OSTI · code-45480
A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x
Abstract
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
Keep this discovery
Explore connections, maps & timelines
Bent, Rusell, Nagarajan, Harsha, Sundar, Kaarthik, Wang, Site, Hijazi, Hassan. 2017-09-25. A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x. https://doi.org/10.11578/dc.20201001.37
Cite the original work for its findings. Save a collection to share your selection of sources.