Cited in
(21)- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- LogMIP
- MacMINLP
- iOptimize
- PrincetonLib
- HASP
- FilterSD
- IBMLib
- A hybrid LP/NLP paradigm for global optimization relaxations
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- PaPILO
- Domain reduction techniques for global NLP and MINLP optimization
- Three enhancements for optimization-based bound tightening
This page was built for software: CMU-IBM
