Pages that link to "Item:Q2897302"
From MaRDI portal
The following pages link to An Algorithmic Framework for MINLP with Separable Non-Convexity (Q2897302):
Displaying 5 items.
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
