Solving the multistage PMU placement problem by integer programming and equivalent network design model

DOI10.1007/s10898-018-0672-8zbMath1426.90193OpenAlexW2808588839WikidataQ129687295 ScholiaQ129687295MaRDI QIDQ2423817

Neng Fan, Ou Sun

Publication date: 20 June 2019

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10150/633264

zbMATH Keywords

integer programmingnetwork designzero-injection busesmultistage placementPMU placement

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Related Items (1)

The probabilistic and reliable connected power dominating set problems

Cites Work

• New dominating sets in social networks
• On the power domination number of the generalized Petersen graphs
• Minimum vertex cover in ball graphs through local search
• PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Power domination in cylinders, tori, and generalized Petersen graphs
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• Power Domination in Product Graphs
• Domination in Graphs Applied to Electric Power Networks
• Power domination in planar graphs with small diameter
• The PMU Placement Problem

This page was built for publication: Solving the multistage PMU placement problem by integer programming and equivalent network design model