A fixed-depth branch-and-bound algorithm using QC relaxation lower bounds narrows the optimality gap on small PGLib cases, without proof of global optimality.
A Review of Selected Optimal Power Flow Literature to 1993. Parts I and II,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Scalable Global Optimization for AC-OPF via Quadratic Convex Relaxation and Branch-and-Bound
A fixed-depth branch-and-bound algorithm using QC relaxation lower bounds narrows the optimality gap on small PGLib cases, without proof of global optimality.