CMU-IBM
From MaRDI portal
Software:25409
swMATH13495MaRDI QIDQ25409FDOQ25409
Author name not available (Why is that?)
Cited In (13)
- 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
- 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
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Domain reduction techniques for global NLP and MINLP optimization
- Three enhancements for optimization-based bound tightening
This page was built for software: CMU-IBM
