2019
DOI: 10.1109/tpwrs.2018.2863266
|View full text |Cite
|
Sign up to set email alerts
|

A Mathematical Programming Solution for Automatic Generation of Synthetic Power Flow Cases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 30 publications
0
12
0
Order By: Relevance
“…Protection & Control N/A [66], [67] [34], [48], [62], [68], [69] length needed to traverse from nodes i to j, calculated using Dijkstra's algorithm [71].…”
Section: Operationalmentioning
confidence: 99%
See 4 more Smart Citations
“…Protection & Control N/A [66], [67] [34], [48], [62], [68], [69] length needed to traverse from nodes i to j, calculated using Dijkstra's algorithm [71].…”
Section: Operationalmentioning
confidence: 99%
“…Another metric is the line loading defined as the ratio of apparent power flow with respect to the MVA rating at surge impedance loading 1 , which followed an exponential decay for EI and WI [48], [63]. The power flows across all branches were statistically modeled and used in [62].…”
Section: ) Power Qualitymentioning
confidence: 99%
See 3 more Smart Citations