An improved binary programming formulation for the secure domination problem
The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful to date is a binary programming formulation which is solved...
Gespeichert in:
| Veröffentlicht in: | Annals of operations research 2020-12, Vol.295 (2), p.561-573 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 573 |
|---|---|
| container_issue | 2 |
| container_start_page | 561 |
| container_title | Annals of operations research |
| container_volume | 295 |
| creator | Burdett, Ryan Haythorpe, Michael |
| description | The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful to date is a binary programming formulation which is solved using CPLEX. A new binary programming formulation is proposed here which requires fewer constraints and fewer binary variables than the existing formulation. It is implemented in CPLEX, and tested on certain families of graphs that have previously been considered in the context of secure domination. It is shown that the runtime required for the new formulation to solve the instances is significantly less than that of the existing formulation. An extension of our formulation that solves the related, but further constrained, secure connected domination problem is also given; to the best of the authors’ knowledge, this is the first such formulation in literature. |
| doi_str_mv | 10.1007/s10479-020-03810-6 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2473380450</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A651172347</galeid><sourcerecordid>A651172347</sourcerecordid><originalsourceid>FETCH-LOGICAL-c423t-82a60ee64b5298fd4c0c61ea9db3ff5eb4517f7b6a7e5f5626ba0a2f684437b83</originalsourceid><addsrcrecordid>eNp9kUtr3DAURkVpoZNp_0BWhm7rydXbsxyG5gED2aRrIdlXHg1jOZXsQv99lTiQBkIR6HmOLtJHyCWFDQXQV5mC0NsaGNTAGwq1-kBWVGpWbzlvPpIVMClqyTl8Jhc5nwCA0kauyGEXqzA8pvE3dpUL0aY_VVn1yQ5DiH3lxzTMZzuFMT7Nq-mIVcZ2Tlh1YyGWk2K4Mw5fyCdvzxm_voxr8vP6x8P-tj7c39ztd4e6FYxPdcOsAkQlnGTbxneihVZRtNvOce8lOiGp9topq1F6qZhyFizzqhGCa9fwNfm23Fvq_poxT-Y0zimWkoYJXR4MQsIr1dszmhD9OCXbDiG3ZqckpZrxAq_J5h2qtA6H0I4RfSj7b4Tv_whuziFiLl0O_XHKvZ1zfouzBW_TmHNCbx5TGMo3GwrmKTuzZGdKduY5O6OKxBcpFzj2mF4f-B_rL1udmxI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2473380450</pqid></control><display><type>article</type><title>An improved binary programming formulation for the secure domination problem</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Burdett, Ryan ; Haythorpe, Michael</creator><creatorcontrib>Burdett, Ryan ; Haythorpe, Michael</creatorcontrib><description>The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful to date is a binary programming formulation which is solved using CPLEX. A new binary programming formulation is proposed here which requires fewer constraints and fewer binary variables than the existing formulation. It is implemented in CPLEX, and tested on certain families of graphs that have previously been considered in the context of secure domination. It is shown that the runtime required for the new formulation to solve the instances is significantly less than that of the existing formulation. An extension of our formulation that solves the related, but further constrained, secure connected domination problem is also given; to the best of the authors’ knowledge, this is the first such formulation in literature.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-020-03810-6</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Business and Management ; Combinatorics ; Constraints ; Graph theory ; Graphs ; Mathematical research ; Neighborhoods ; Operations research ; Operations Research/Decision Theory ; Original Research ; Programming ; Theory of Computation</subject><ispartof>Annals of operations research, 2020-12, Vol.295 (2), p.561-573</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020</rights><rights>COPYRIGHT 2020 Springer</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c423t-82a60ee64b5298fd4c0c61ea9db3ff5eb4517f7b6a7e5f5626ba0a2f684437b83</citedby><cites>FETCH-LOGICAL-c423t-82a60ee64b5298fd4c0c61ea9db3ff5eb4517f7b6a7e5f5626ba0a2f684437b83</cites><orcidid>0000-0001-8143-6583</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10479-020-03810-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-020-03810-6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,41466,42535,51296</link.rule.ids></links><search><creatorcontrib>Burdett, Ryan</creatorcontrib><creatorcontrib>Haythorpe, Michael</creatorcontrib><title>An improved binary programming formulation for the secure domination problem</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful to date is a binary programming formulation which is solved using CPLEX. A new binary programming formulation is proposed here which requires fewer constraints and fewer binary variables than the existing formulation. It is implemented in CPLEX, and tested on certain families of graphs that have previously been considered in the context of secure domination. It is shown that the runtime required for the new formulation to solve the instances is significantly less than that of the existing formulation. An extension of our formulation that solves the related, but further constrained, secure connected domination problem is also given; to the best of the authors’ knowledge, this is the first such formulation in literature.</description><subject>Algorithms</subject><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Constraints</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Mathematical research</subject><subject>Neighborhoods</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Original Research</subject><subject>Programming</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><sourceid>BENPR</sourceid><recordid>eNp9kUtr3DAURkVpoZNp_0BWhm7rydXbsxyG5gED2aRrIdlXHg1jOZXsQv99lTiQBkIR6HmOLtJHyCWFDQXQV5mC0NsaGNTAGwq1-kBWVGpWbzlvPpIVMClqyTl8Jhc5nwCA0kauyGEXqzA8pvE3dpUL0aY_VVn1yQ5DiH3lxzTMZzuFMT7Nq-mIVcZ2Tlh1YyGWk2K4Mw5fyCdvzxm_voxr8vP6x8P-tj7c39ztd4e6FYxPdcOsAkQlnGTbxneihVZRtNvOce8lOiGp9topq1F6qZhyFizzqhGCa9fwNfm23Fvq_poxT-Y0zimWkoYJXR4MQsIr1dszmhD9OCXbDiG3ZqckpZrxAq_J5h2qtA6H0I4RfSj7b4Tv_whuziFiLl0O_XHKvZ1zfouzBW_TmHNCbx5TGMo3GwrmKTuzZGdKduY5O6OKxBcpFzj2mF4f-B_rL1udmxI</recordid><startdate>20201201</startdate><enddate>20201201</enddate><creator>Burdett, Ryan</creator><creator>Haythorpe, Michael</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0001-8143-6583</orcidid></search><sort><creationdate>20201201</creationdate><title>An improved binary programming formulation for the secure domination problem</title><author>Burdett, Ryan ; Haythorpe, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c423t-82a60ee64b5298fd4c0c61ea9db3ff5eb4517f7b6a7e5f5626ba0a2f684437b83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Constraints</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Mathematical research</topic><topic>Neighborhoods</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Original Research</topic><topic>Programming</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Burdett, Ryan</creatorcontrib><creatorcontrib>Haythorpe, Michael</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Burdett, Ryan</au><au>Haythorpe, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An improved binary programming formulation for the secure domination problem</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2020-12-01</date><risdate>2020</risdate><volume>295</volume><issue>2</issue><spage>561</spage><epage>573</epage><pages>561-573</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful to date is a binary programming formulation which is solved using CPLEX. A new binary programming formulation is proposed here which requires fewer constraints and fewer binary variables than the existing formulation. It is implemented in CPLEX, and tested on certain families of graphs that have previously been considered in the context of secure domination. It is shown that the runtime required for the new formulation to solve the instances is significantly less than that of the existing formulation. An extension of our formulation that solves the related, but further constrained, secure connected domination problem is also given; to the best of the authors’ knowledge, this is the first such formulation in literature.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-020-03810-6</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0001-8143-6583</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0254-5330 |
| ispartof | Annals of operations research, 2020-12, Vol.295 (2), p.561-573 |
| issn | 0254-5330 1572-9338 |
| language | eng |
| recordid | cdi_proquest_journals_2473380450 |
| source | Business Source Complete; SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Business and Management Combinatorics Constraints Graph theory Graphs Mathematical research Neighborhoods Operations research Operations Research/Decision Theory Original Research Programming Theory of Computation |
| title | An improved binary programming formulation for the secure domination problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T09%3A28%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20improved%20binary%20programming%20formulation%20for%20the%20secure%20domination%20problem&rft.jtitle=Annals%20of%20operations%20research&rft.au=Burdett,%20Ryan&rft.date=2020-12-01&rft.volume=295&rft.issue=2&rft.spage=561&rft.epage=573&rft.pages=561-573&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-020-03810-6&rft_dat=%3Cgale_proqu%3EA651172347%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2473380450&rft_id=info:pmid/&rft_galeid=A651172347&rfr_iscdi=true |