Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming

Fan, Neng; Watson, Jean Paul

doi:10.1007/978-3-642-31770-5_33

Cited by 45 publications

(49 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even for instances with more than 2000 buses optimal placement can be found within a few minutes on a PC. This agrees with the computation findings in [19] for variants of the dominating set problem. For the case without line power flow measurements the perfect protection problem can be reduced into a domination type integer program, which further improves computation efficiency.…”

Section: Numerical Studiessupporting

confidence: 91%

Protection Placement for State Estimation Measurement Data Integrity

Sou

2019

2019 IEEE International Conference on Industrial Cyber Physical Systems (ICPS)

View full text Add to dashboard Cite

In this paper a protection placement problem for power network measurement system data integrity is considered. The placement problem is motivated from the data secure power network design applications in [Dan and Sandberg 2010]. The problem is shown to be NP-hard and an integer linear programming formulation is provided based on the topological observability condition by [Krumpholz, Clements and Davis 1980]. The incorporation of the observability condition requires a graph connectivity constraint which is found to be most effectively described by the Miller-Tucker-Zemlin (MTZ) conditions. For a specialization without line power flow measurements, the protection placement problem can be modeled by a domination type integer linear program much easier to solve than the general formulation requiring graph connectivity. Numerical studies with IEEE benchmark and other large power systems with more than 2000 buses indicate that using the proposed formulations, the protection placement problem can be solved in negligible amount of time in realistic application settings.Index Terms-Power system state estimation, false data injection attack, equipment placement, observability, integer linear programming.arXiv:1811.05156v1 [math.OC]

show abstract

Section: Numerical Studiessupporting

confidence: 91%

Protection Placement for State Estimation Measurement Data Integrity

Sou

2019

2019 IEEE International Conference on Industrial Cyber Physical Systems (ICPS)

View full text Add to dashboard Cite

show abstract

“…A time limit of 1 hour was set on every single run. Gendron et al (2014) finally implemented XPRESS to solve the MTZ reformulation for the MCDSP in Fan and Watson (2012) .…”

Section: Test Methods In the Comparison Studymentioning

confidence: 99%

“…Many practical applications of the MLSTP/MCDSP (equivalent to the RLP) are discussed in Lucena et al (2010) and Gendron et al (2014) . Since the problem is N P -hard, researchers have studied exact algorithms ( Chen et al, 2010;Fan & Watson, 2012;Fujie, 2003;Gendron et al, 2014;Lucena et al, 2010;Simonetti, Salles da Cunha, & Lucena, 2011 ), heuristics ( Chen et al, 2010;Duarte, Martí, Resende, & Silva, 2014;Lucena et al, 2010;Sen et al, 2008;Yue, Li, Wei, & Lin, 2014 ), and approximation algorithms ( Flammini, Marchetti-Spaccamela, Monaco, Moscardelli, & Zaks, 2011;Guha & Khuller, 1998 ) for solving these problems.…”

Section: Introductionmentioning

confidence: 99%

“…Another set of valid cutinequalities were derived by observing that whenever S and V \ S are non-dominating set of nodes, at least one edge across the cut ( S , V \ S ) must be chosen in the solution tree. Fan and Watson (2012) presented compact formulations for the MCDSP and solved these formulations using CPLEX 12.1. Fernau et al (2011) developed an exact approach, which can solve the MCDSP in O (1.8966 n ) time, but did not present computational results.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Aneja

2017

European Journal of Operational Research

View full text Add to dashboard Cite

“…For the next benchmark for the MCDS problem, the instance has its name starting with the IEEE and RTS. This benchmark, called BPFTC graph, is introduced from the computational study in Fan & Watson (2012). Finally, RGG benchmark is the same graphs presented by Jovanovic & Tuba (2013), with up to 400 vertices.…”

Section: Experiments On the Connected Dominating Setmentioning

confidence: 99%

Matheuristics for Variants of the Dominating Set Problem

ALBUQUERQUE¹

View full text Add to dashboard Cite

Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming

Cited by 45 publications

References 24 publications

Protection Placement for State Estimation Measurement Data Integrity

Protection Placement for State Estimation Measurement Data Integrity

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Matheuristics for Variants of the Dominating Set Problem

Contact Info

Product

Resources

About