Fort Neighborhoods: A Set Cover Formulation for Power Domination

Simple item page
dc.contributor.advisorHicks, Illya V
dc.creatorSmith, Logan
dc.date.accessioned2019-05-17T15:42:30Z
dc.date.available2019-05-17T15:42:30Z
dc.date.created2018-08
dc.date.issued2018-11-14
dc.date.submittedAugust 2018
dc.date.updated2019-05-17T15:42:30Z
dc.description.abstractThis thesis introduces a novel separation algorithm for calculating power domination numbers and minimum power dominating sets in graphs. Additionally, it shows how the existence of solutions of special forms can be exploited by computational methods. Power domination studies arise from a key problem in electrical engineering concerning placements of monitoring devices known as Phasor Measurement Units (PMUs). PMUs are installed in electrical networks for early detection of electrical imbalances, enabling corrective actions to mitigate outages. In graph representations of electrical networks, power dominating sets denote locations at which PMUs can be placed to monitor entire networks. Due to PMU installation costs of up to $200,000, it is desirable to identify minimum power dominating sets and their cardinality, known is the graph’s power domination number. Unlike prior methods, this work exploits crucial yet previously neglected graph structures: the neighborhoods of zero forcing forts. Utilizing these structures, algorithms are devised for calculating minimum power dominating sets and the power domination numbers of graphs. Computational experiments demonstrating an order of magnitude improvement over previous methods are presented.
dc.format.mimetypeapplication/pdf
dc.identifier.citationSmith, Logan. "Fort Neighborhoods: A Set Cover Formulation for Power Domination." (2018) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/105803">https://hdl.handle.net/1911/105803</a>.
dc.identifier.urihttps://hdl.handle.net/1911/105803
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.subjectCombinatorial Optimization
dc.subjectGraph Theory
dc.subjectDiscrete Mathematics
dc.titleFort Neighborhoods: A Set Cover Formulation for Power Domination
dc.typeThesis
dc.type.materialText
thesis.degree.departmentComputational and Applied Mathematics
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.majorDiscrete Optimization
thesis.degree.nameMaster of Arts
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
SMITH-DOCUMENT-2018.pdf
Size:
319.54 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.84 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.6 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Electronic Theses and Dissertations