Solving the multistage PMU placement problem by integer programming and equivalent network design model
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-018-0672-8
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Guangjun Xu & Liying Kang, 2011. "On the power domination number of the generalized Petersen graphs," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 282-291, August.
- Zhao Zhang & Weili Wu & Lidan Fan & Ding-Zhu Du, 2014. "Minimum vertex cover in ball graphs through local search," Journal of Global Optimization, Springer, vol. 59(2), pages 663-671, July.
- Xianliang Liu & Hongliang Lu & Wei Wang & Weili Wu, 2013. "PTAS for the minimum k-path connected vertex cover problem in unit disk graphs," Journal of Global Optimization, Springer, vol. 56(2), pages 449-458, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- David G. L. Wang & Monica M. Y. Wang & Shiqiang Zhang, 2022. "Determining the edge metric dimension of the generalized Petersen graph P(n, 3)," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 460-496, March.
- Chung-Shou Liao, 2016. "Power domination with bounded time constraints," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 725-742, February.
- Limin Wang & Wenxue Du & Zhao Zhang & Xiaoyan Zhang, 2017. "A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 106-122, January.
- Lina Chen & Xiaohui Huang & Zhao Zhang, 2018. "A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 35-43, July.
- Chao Wang & Lei Chen & Changhong Lu, 2016. "$$k$$ k -Power domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 865-873, February.
- Ran, Yingli & Zhang, Zhao & Huang, Xiaohui & Li, Xiaosong & Du, Ding-Zhu, 2019. "Approximation algorithms for minimum weight connected 3-path vertex cover," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 723-733.
More about this item
Keywords
PMU placement; Multistage placement; Zero-injection buses; Integer programming; Network design;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-018-0672-8. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.