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