The following pages link to CMU-IBM (Q25409):
Displaying 13 items.
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
