Heuristics for the power edge set problem
AS Kare, S Valluru - 2020 11th international conference on …, 2020 - ieeexplore.ieee.org
A power grid is an interconnected network to distribute electricity generated from power
stations to consumers. If the supply and the demand of the power grid is not matched, there …
stations to consumers. If the supply and the demand of the power grid is not matched, there …
Meta-heuristics for the Single-Channel PMU Placement Problem Considering Zero-Injection-Buses
KN Reddy, AS Kare - … : Proceedings of ICCIS 2022, Volume 1, 2023 - books.google.com
Phasor measurement units (PMUs) are time-synchronized devices that can provide high-
speed measurements of different power stations in real time. These time-synchronized …
speed measurements of different power stations in real time. These time-synchronized …
Meta-heuristics for the Single-Channel PMU Placement Problem Considering Zero-Injection-Buses
K Narasa Reddy, AS Kare - International Conference on Communication …, 2022 - Springer
Phasor measurement units (PMUs) are time-synchronized devices that can provide high-
speed measurements of different power stations in real time. These time-synchronized …
speed measurements of different power stations in real time. These time-synchronized …
POWER EDGE SET (PES)
ZFSET ZFS - … : 30th International Workshop, IWOCA 2019, Pisa …, 2019 - books.google.com
Previous work. Assigning a minimum number of PMUS to monitor the whole network is
known to be NP-hard in general for both PES and ZFS. For the former, some complexity …
known to be NP-hard in general for both PES and ZFS. For the former, some complexity …
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
M Weller - Combinatorial Algorithms - Springer
This paper presents new complexity and non-approximation results concerning two color
propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic …
propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic …
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
This paper presents new complexity and non-approximation results concerning two color
propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic …
propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic …