{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:05:03Z","timestamp":1750133103467,"version":"3.41.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10479-025-06571-2","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T03:21:24Z","timestamp":1743218484000},"page":"1891-1931","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum-cardinality global defensive alliances in general graphs"],"prefix":"10.1007","volume":"349","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3689-7185","authenticated-orcid":false,"given":"Andr\u00e9","family":"Rossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"issue":"1","key":"6571_CR1","first-page":"23","volume":"58","author":"H Balakrishnan","year":"2006","unstructured":"Balakrishnan, H., Cami, A., Deo, N., & Dutton, R. D. (2006). On the complexity of finding optimal global alliances. Journal of Combinatorial Mathematics and Combinatorial Computing, 58(1), 23\u201331.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"issue":"2","key":"6571_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ejor.2009.10.019","volume":"206","author":"C Bazgan","year":"2010","unstructured":"Bazgan, C., Tuza, Z., & Vanderpooten, D. (2010). Satisfactory graph partition, variants, and generalizations. European Journal of Operational Research, 206(2), 271\u2013280.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"6571_CR3","doi-asserted-by":"publisher","first-page":"2140","DOI":"10.1016\/j.disc.2006.10.026","volume":"309","author":"RC Brigham","year":"2009","unstructured":"Brigham, R. C., Dutton, R. D., Haynes, T. W., & Hedetniemi, S. T. (2009). Powerful alliances in graphs. Discrete Mathematics, 309(8), 2140\u20132147.","journal-title":"Discrete Mathematics"},{"key":"6571_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10479-020-03810-6","volume":"295","author":"R Burdett","year":"2020","unstructured":"Burdett, R., & Haythorpe, M. (2020). An improved binary programming formulation for the secure domination problem. Annals of Operations Research, 295, 561\u2013573.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"6571_CR5","first-page":"772","volume":"49","author":"P Chalermsook","year":"2020","unstructured":"Chalermsook, P., Cygan, M., Kortsarz, G., Laekhanukit, B., Manurangsi, P., Nanongkai, D., & Trevisan, L. (2020). From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique. Dominating Set, and More, SIAM Journal on Computing, 49(4), 772\u2013810.","journal-title":"Dominating Set, and More, SIAM Journal on Computing"},{"issue":"6","key":"6571_CR6","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1016\/j.ejc.2009.07.007","volume":"31","author":"SM Cioab\u0103","year":"2010","unstructured":"Cioab\u0103, S. M., van Dam, E. R., Koolen, J. H., & Lee, J. H. (2010). A lower bound for the spectral radius of graphs with fixed diameter. European Journal of Combinatorics, 31(6), 1560\u20131566.","journal-title":"European Journal of Combinatorics"},{"key":"6571_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105368","volume":"133","author":"P Corcoran","year":"2021","unstructured":"Corcoran, P., & Gagarin, A. (2021). Heuristics for $$k$$-domination models of facility location problems in street networks. Computers & Operations Research, 133, 105368.","journal-title":"Computers & Operations Research"},{"key":"6571_CR8","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.","edition":"3"},{"key":"6571_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., & R\u00e9nyi, A. (1959). On Random Graphs. Publicationes Mathematicae, 6, 290\u2013297.","journal-title":"Publicationes Mathematicae"},{"key":"6571_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and Surveys on Metaheuristics","author":"P Festa","year":"2002","unstructured":"Festa, P., & Resende, M. G. C. (2002). GRASP: An annotated bibliography. In C. C. Ribeiro & P. Hansen (Eds.), Essays and Surveys on Metaheuristics (pp. 325\u2013367). Kluwer Academic Publishers."},{"issue":"2","key":"6571_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/S0097539702419649","volume":"36","author":"FV Fomin","year":"2006","unstructured":"Fomin, F. V., & Thilikos, D. M. (2006). Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM Journal on Computing, 36(2), 281\u2013309.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"6571_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0377-2217(99)00459-2","volume":"125","author":"MU Gerber","year":"2000","unstructured":"Gerber, M. U., & Kobler, D. (2000). Algorithmic approach to the satisfactory graph partitioning problem. European Journal of Operational Research, 125(2), 283\u2013291.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6571_CR13","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1002\/net.22034","volume":"77","author":"NVC Gudapati","year":"2021","unstructured":"Gudapati, N. V. C., Malaguti, E., & Monaci, M. (2021). In search of dense subgraphs: How good is greedy peeling? Networks, 77(4), 572\u2013586.","journal-title":"Networks"},{"issue":"12","key":"6571_CR14","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1016\/j.dam.2011.11.026","volume":"161","author":"A Harutyunyan","year":"2013","unstructured":"Harutyunyan, A. (2013). Some bounds on global alliances in trees. Discrete Applied Mathematics, 161(12), 1739\u20131746.","journal-title":"Discrete Applied Mathematics"},{"key":"6571_CR15","doi-asserted-by":"crossref","unstructured":"Haynes, T. W., Hedetniemi, S. T., & Henning, M. A. (2003). Global defensive alliances in graphs. The Electronic Journal of Combinatorics, 10, Article R47.","DOI":"10.37236\/1740"},{"key":"6571_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/1471-2105-7-108","volume":"7","author":"TW Haynes","year":"2006","unstructured":"Haynes, T. W., Knisley, D., Seier, E., & Zou, Y. (2006). A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinformatics, 7, 108.","journal-title":"BMC Bioinformatics"},{"key":"6571_CR17","first-page":"157","volume":"48","author":"SM Hedetniemi","year":"2004","unstructured":"Hedetniemi, S. M., Hedetniemi, S. T., & Kristiansen, P. (2004). Alliances in graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 48, 157\u2013177.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"6571_CR18","volume-title":"Essentials of Metaheuristics","author":"S Luke","year":"2012","unstructured":"Luke, S. (2012). Essentials of Metaheuristics (2nd ed.). Lulu.","edition":"2"},{"key":"6571_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016). Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19, 79\u2013102.","journal-title":"Discrete Optimization"},{"key":"6571_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107437","volume":"108","author":"MR Nakkala","year":"2021","unstructured":"Nakkala, M. R., Singh, A., & Rossi, A. (2021). Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem. Applied Soft Computing, 108, 107437.","journal-title":"Applied Soft Computing"},{"key":"6571_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104647","volume":"109","author":"MR Nakkala","year":"2022","unstructured":"Nakkala, M. R., Singh, A., & Rossi, A. (2022). Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem. Engineering Applications of Artificial Intelligence, 109, 104647.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"6571_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.akcej.2017.05.002","volume":"15","author":"K Ouazine","year":"2018","unstructured":"Ouazine, K., Slimani, H., & Tari, A. (2018). Alliances in graphs: Parameters, properties and applications - A survey. AKCE International Journal of Graphs and Combinatorics, 15, 115\u2013154.","journal-title":"AKCE International Journal of Graphs and Combinatorics"},{"issue":"2","key":"6571_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ejor.2010.11.010","volume":"210","author":"B Ries","year":"2011","unstructured":"Ries, B., & Zenklusen, R. (2011). A 2-approximation for the maximum satisfying bisection problem. European Journal of Operational Research, 210(2), 169\u2013175.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6571_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.7151\/dmgt.1351","volume":"27","author":"JA Rodr\u00edguez-Vel\u00e1zquez","year":"2007","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J. A., & Sigarreta, J. M. (2007). Spectral study of alliances in graphs. Discussiones Mathematicae Graph Theory, 27(1), 143\u2013157.","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"1","key":"6571_CR25","first-page":"83","volume":"4","author":"JA Rodr\u00edguez-Vel\u00e1zquez","year":"2007","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J. A., & Sigarreta, J. M. (2007). Global alliances in planar graphs. AKCE International Journal of Graphs and Combinatorics, 4(1), 83\u201398.","journal-title":"AKCE International Journal of Graphs and Combinatorics"},{"issue":"2","key":"6571_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.dam.2008.02.006","volume":"157","author":"JA Rodr\u00edguez-Vel\u00e1zquez","year":"2009","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J. A., & Sigarreta, J. M. (2009). Global defensive $$k$$-alliances in graphs. Discrete Applied Mathematics, 157(2), 211\u2013218.","journal-title":"Discrete Applied Mathematics"},{"key":"6571_CR27","unstructured":"Rossi, R.A., & Ahmed, N.K. (2015). The Network Data Repository with Interactive Graph Analytics and Visualization, In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25\u201330, 2015, Austin, Texas, USA, 4292\u20134293. https:\/\/networkrepository.com"},{"issue":"3","key":"6571_CR28","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s11227-011-0607-3","volume":"61","author":"H Seba","year":"2012","unstructured":"Seba, H., Lagraa, S., & Kheddouci, H. (2012). Alliance-based clustering scheme for group key management in mobile ad hoc networks. The Journal of Supercomputing, 61(3), 481\u2013501.","journal-title":"The Journal of Supercomputing"},{"issue":"2","key":"6571_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2008.02.007","volume":"157","author":"JM Sigarreta","year":"2009","unstructured":"Sigarreta, J. M., & Rodr\u00edguez-Vel\u00e1zquez, J. A. (2009). On the global offensive number of a graph. Discrete Applied Mathematics, 157(2), 219\u2013226.","journal-title":"Discrete Applied Mathematics"},{"key":"6571_CR30","doi-asserted-by":"crossref","unstructured":"Srimani, P.K. & Xu, Z. (2007). Distributed protocols for defensive and offensive alliances in network graphs using self-stabilization. In: Proceedings of the International Conference on Computing: Theory and Applications, Kolkata, India.","DOI":"10.1109\/ICCTA.2007.54"},{"key":"6571_CR31","volume-title":"Introduction to graph theory","author":"D West","year":"2000","unstructured":"West, D. (2000). Introduction to graph theory. Pearson."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06571-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06571-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06571-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:09:20Z","timestamp":1750093760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06571-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,26]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["6571"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06571-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2025,3,26]]},"assertion":[{"value":"8 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}]}}