{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:09:56Z","timestamp":1773583796543,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T00:00:00Z","timestamp":1601164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T00:00:00Z","timestamp":1601164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10479-020-03810-6","type":"journal-article","created":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T06:02:25Z","timestamp":1601186545000},"page":"561-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An improved binary programming formulation for the secure domination problem"],"prefix":"10.1007","volume":"295","author":[{"given":"Ryan","family":"Burdett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8143-6583","authenticated-orcid":false,"given":"Michael","family":"Haythorpe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,27]]},"reference":[{"key":"3810_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2017.10.020","volume":"236","author":"T Araki","year":"2018","unstructured":"Araki, T., & Yumoto, I. (2018). On the secure domination numbers of maximal outerplanar graphs. Discrete Applied Mathematics, 236, 23\u201329.","journal-title":"Discrete Applied Mathematics"},{"key":"3810_CR2","first-page":"321","volume":"85","author":"AP Burger","year":"2013","unstructured":"Burger, A. P., de Villiers, A. P., & van Vuuren, J. H. (2013). Two algorithms for secure graph domination. Journal of Combinatorial Mathematics and Combinatorial Computing, 85, 321\u2013339.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"3810_CR3","unstructured":"Burger, A.P., de Villiers, A.P., & van Vuuren, J.H. (2013). A binary programming approach towards achieving effective graph protection. In: Proceedings of the 2013 ORSSA annual conference, ORSSA 2013, pp. 19\u201330."},{"key":"3810_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2014.02.001","volume":"171","author":"AP Burger","year":"2014","unstructured":"Burger, A. P., de Villiers, A. P., & van Vuuren, J. H. (2014). A linear algorithm for secure domination in trees. Discrete Applied Mathematics, 171, 15\u201327.","journal-title":"Discrete Applied Mathematics"},{"issue":"25","key":"3810_CR5","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.12988\/ijma.2015.5247","volume":"9","author":"AG Cabaro","year":"2015","unstructured":"Cabaro, A. G., & Canoy, S. R, Jr. (2015). Secure connected dominating sets in the join and composition of graphs. International Journal of Mathematical Analysis, 9(25), 1241\u20131248.","journal-title":"International Journal of Mathematical Analysis"},{"key":"3810_CR6","first-page":"19","volume":"67","author":"EJ Cockayne","year":"2005","unstructured":"Cockayne, E. J., Grobler, P. J. P., Grundlingh, W. R., Munganga, J., & van Vuuren, J. H. (2005). Protection of a graph. Utilitas Mathematica, 67, 19\u201332.","journal-title":"Utilitas Mathematica"},{"key":"3810_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2943-7","author":"S Elloumi","year":"2018","unstructured":"Elloumi, S., Hudry, O., Marie, E., Martin, A., Plateau, A., & Rovedakis, S. (2018). Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Annals of Operations Research,. https:\/\/doi.org\/10.1007\/s10479-018-2943-7.","journal-title":"Annals of Operations Research"},{"key":"3810_CR8","unstructured":"De Jaenisch, C.F. (1862). Trait\u00e9 des applications de l\u2019analyse math\u00e9matique au jeu des \u00e9checs. L\u2019Acad\u00e9mie Imp\u00e9riale Des Sciences."},{"key":"3810_CR9","doi-asserted-by":"crossref","unstructured":"Fan, N., Watson, J.P. (2012). Solving the connected dominating set problem and power dominating set problem by integer programming. In: G. Lin (Ed.) Combinatorial optimization and applications. Lecture notes in computer sciences (Vol. 7402, pp. 371\u2013383), Berlin\/Heidelberg, Springer.","DOI":"10.1007\/978-3-642-31770-5_33"},{"key":"3810_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"2013","unstructured":"Haynes, T. W., Hedetniemi, S., & Slater, P. (2013). Fundamentals of domination in graphs. Boca Raton: CRC Press."},{"key":"3810_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.endm.2017.11.001","volume":"63","author":"D Lad","year":"2017","unstructured":"Lad, D., Reddy, P. V. S., & Kumar, J. P. (2017). Complexity issues of variants of secure domination in graphs. Electronic Notes in Discrete Mathematics, 63, 77\u201384.","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"15","key":"3810_CR12","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ipl.2015.05.006","volume":"115","author":"HB Merouane","year":"2015","unstructured":"Merouane, H. B., & Chellali, M. (2015). On secure domination in graphs. Information Processing Letters, 115(15), 786\u2013790.","journal-title":"Information Processing Letters"},{"issue":"4","key":"3810_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of ACM, 7(4), 326\u2013329.","journal-title":"Journal of ACM"},{"issue":"2","key":"3810_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10878-017-0197-y","volume":"35","author":"D Pradhan","year":"2018","unstructured":"Pradhan, D., & Jha, A. (2018). On computing a minimum secure dominating set in block graphs. Journal of Combinatorial Optimization, 35(2), 613\u2013631.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"6","key":"3810_CR15","first-page":"607","volume":"13","author":"E Sampathkumar","year":"1979","unstructured":"Sampathkumar, E., & Walikar, H. B. (1979). The connected domination number of a graph. Journal of Mathematical and Physical Sciences, 13(6), 607\u2013613.","journal-title":"Journal of Mathematical and Physical Sciences"},{"issue":"17","key":"3810_CR16","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.dam.2011.07.001","volume":"159","author":"JMM Van Rooji","year":"2011","unstructured":"Van Rooji, J. M. M., & Bodlaender, H. L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159(17), 2147\u20132164.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"3810_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.7151\/dmgt.2008","volume":"38","author":"H Wang","year":"2018","unstructured":"Wang, H., Zhao, Y., & Deng, Y. (2018). The complexity of secure domination problem in graphs. Discussiones Mathematicae Graph Theory, 38(2), 385\u2013398.","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"3810_CR18","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/S0021-9800(69)80116-X","volume":"6","author":"ME Watkins","year":"1969","unstructured":"Watkins, M. E. (1969). A theorem on tait colorings with an application to the generalized petersen graphs. Journal of Combinatorial Theory, 6, 152\u2013164.","journal-title":"Journal of Combinatorial Theory"},{"key":"3810_CR19","unstructured":"Winter, A. (2018). Domination, Total Domination and Secure Domination. Honours Thesis, University of South Australia."},{"key":"3810_CR20","doi-asserted-by":"crossref","unstructured":"Yuan, D. (2005). Energy-efficient broadcastig in wireless ad hoc networks: Performance benchmarking and distributed algorithms based on network connectivity characterization. In Proceedings of the 8th ACM international symposium on modeling, analysis and simulation of wireless and mobile systems, pp. 28\u201335.","DOI":"10.1145\/1089444.1089451"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03810-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03810-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03810-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:10:06Z","timestamp":1632701406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03810-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,27]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3810"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03810-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,27]]},"assertion":[{"value":"22 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}