Pages that link to "Item:Q1741115"
From MaRDI portal
The following pages link to Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115):
Displaying 17 items.
- Global optimal power flow over large-scale power transmission networks (Q1624891) (← links)
- Alternating current optimal power flow with generator selection (Q1661909) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications (Q2116838) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Strong NP-hardness of AC power flows feasibility (Q2294366) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Strong SOCP Relaxations for the Optimal Power Flow Problem (Q2957450) (← links)
- Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices (Q5072587) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems (Q5853569) (← 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)
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem (Q6568415) (← links)
