The power edge set problem

DOI10.1002/NET.21684MaRDI QIDQ4642407zbMATH OpenOpenAlexFDO

Authors Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21684

zbMATH Keywords

observabilitymixed integer linear programbilevel programPMU placement problempower dominating setreal time electrical network monitoring

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Recommendations

• New insights for power edge set problem
• Complexity and lowers bounds for power edge set problem
• The edge domination problem
• Complexity and inapproximability results for the power edge set problem
• Improved complexity for power edge set problem
• Computing and Combinatorics
• Power Edge Set and Zero Forcing Set remain difficult in cubic graphs
• A generalization of Edgesum problem
• The edge general position problem
• scientific article; zbMATH DE number 956849

Cited in

(9)

• Algorithms and applications for a class of bilevel MILPs
• Improved complexity for power edge set problem
• New insights for power edge set problem
• Complexity and lowers bounds for power edge set problem
• Complexity and inapproximability results for the power edge set problem
• New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
• Observability of power systems with optimal PMU placement
• The edge domination problem
• Observing the state of a smart grid using bilevel programming

This page was built for publication: The power edge set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642407)