The following pages link to NESTA (Q43466):
Displaying 14 items.
- (Q47460) (redirect page) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- Convexification of generalized network flow problem (Q1717233) (← links)
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
- A game-theoretic analysis of transmission-distribution system operator coordination (Q1755264) (← links)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
- Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty (Q2140173) (← links)
- Strong SOCP Relaxations for the Optimal Power Flow Problem (Q2957450) (← links)
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- Robust Optimization for Electricity Generation (Q4995074) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
