{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:41:33Z","timestamp":1772858493096,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-024-01017-1","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T08:28:22Z","timestamp":1734683302000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Topological variable neighborhood search"],"prefix":"10.1186","volume":"11","author":[{"given":"Vladimir","family":"Filipovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Kartelj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"key":"1017_CR1","unstructured":"Di\u00a0Pasquale R, Marenco J. Optimization meets big data: a survey. In: DSO workshop IEEE CEC 2017 San Sebastian. IEEE; 2017."},{"issue":"1","key":"1017_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0206-3","volume":"6","author":"RH Hariri","year":"2019","unstructured":"Hariri RH, Fredericks EM, Bowers KM. Uncertainty in big data analytics: survey, opportunities, and challenges. J Big Data. 2019;6(1):1\u201316.","journal-title":"J Big Data."},{"key":"1017_CR3","doi-asserted-by":"crossref","unstructured":"Ochoa G, Verel S, Daolio F, Tomassini M. Local optima networks: a new model of combinatorial fitness landscapes. In: Recent advances in the theory and application of fitness landscapes. 2014; p. 233\u2013262.","DOI":"10.1007\/978-3-642-41888-4_9"},{"key":"1017_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1146\/annurev-statistics-031017-100045","volume":"5","author":"L Wasserman","year":"2018","unstructured":"Wasserman L. Topological data analysis. Ann Rev Statis Appl. 2018;5:501\u201332.","journal-title":"Ann Rev Statis Appl"},{"key":"1017_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fncom.2017.00048","volume":"11","author":"MW Reimann","year":"2017","unstructured":"Reimann MW, Nolte M, Scolamiero M, Turner K, Perin R, Chindemi G, et al. Cliques of neurons bound into cavities provide a missing link between structure and function. Front Comput Neurosci. 2017;11:48.","journal-title":"Front Comput Neurosci"},{"key":"1017_CR6","first-page":"1","volume-title":"Advances in computers","author":"V Blagojevi\u0107","year":"2017","unstructured":"Blagojevi\u0107 V, Boji\u0107 D, Bojovi\u0107 M, Cvetanovi\u0107 M, Djordjevi\u0107 J, Djurdjevi\u0107 D, et al. A systematic approach to generation of new ideas for PhD research in computing. In: Advances in computers, vol. 104. Amsterdam: Elsevier; 2017. p. 1\u201331."},{"key":"1017_CR7","first-page":"1","volume-title":"Advances in computers","author":"M Bankovi\u0107","year":"2020","unstructured":"Bankovi\u0107 M, Filipovi\u0107 V, Graovac J, Had\u017ei-Puri\u0107 J, Hurson AR, Kartelj A, et al. Teaching graduate students how to review research articles and respond to reviewer comments. In: Advances in computers, vol. 116. Amsterdam: Elsevier; 2020. p. 1\u201363."},{"key":"1017_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-014-0008-6","volume":"2","author":"D Singh","year":"2015","unstructured":"Singh D, Reddy CK. A survey on platforms for big data analytics. J Big Data. 2015;2:1\u201320.","journal-title":"J Big Data."},{"key":"1017_CR9","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1007\/s00500-013-1180-x","volume":"18","author":"A Kartelj","year":"2014","unstructured":"Kartelj A, Miti\u0107 N, Filipovi\u0107 V, To\u0161i\u0107 D. Electromagnetism-like algorithm for support vector machine parameter tuning. Soft Comput. 2014;18:1985\u201398.","journal-title":"Soft Comput"},{"issue":"1","key":"1017_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1186\/s40537-021-00485-z","volume":"8","author":"I Sassi","year":"2021","unstructured":"Sassi I, Anter S, Bekkhoucha A. A graph-based big data optimization approach using hidden Markov model and constraint satisfaction problem. J Big Data. 2021;8(1):93.","journal-title":"J Big Data."},{"key":"1017_CR11","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-031-17483-4_13","volume-title":"Data science and predictive analytics: biomedical and health applications using R","author":"ID Dinov","year":"2023","unstructured":"Dinov ID. Function optimization. In: Data science and predictive analytics: biomedical and health applications using R. Berlin: Springer; 2023. p. 713\u201371."},{"issue":"1","key":"1017_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1038\/s41598-017-18940-4","volume":"8","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev YD, Kvasov D, Mukhametzhanov M. On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Sci Rep. 2018;8(1):453.","journal-title":"Sci Rep"},{"key":"1017_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-89619-7_15","volume-title":"Applications of soft computing: from theory to Praxis","author":"V Filipovi\u0107","year":"2009","unstructured":"Filipovi\u0107 V, Kratica J, To\u0161i\u0107 D, Dugo\u0161ija D. GA inspired heuristic for uncapacitated single allocation hub location problem. In: Applications of soft computing: from theory to Praxis. Berlin: Springer; 2009. p. 149\u201358."},{"issue":"1","key":"1017_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2006.06.056","volume":"182","author":"J Kratica","year":"2007","unstructured":"Kratica J, Stanimirovi\u0107 Z, To\u0161i\u0107 D, Filipovi\u0107 V. Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res. 2007;182(1):15\u201328.","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1017_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10589-007-9154-5","volume":"44","author":"J Kratica","year":"2009","unstructured":"Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M. Computing the metric dimension of graphs by genetic algorithms. Comput Optim Appl. 2009;44(2):343\u201361.","journal-title":"Comput Optim Appl"},{"issue":"1","key":"1017_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica J, To\u0161ic D, Filipovi\u0107 V, Ljubi\u0107 I. Solving the simple plant location problem by genetic algorithm. RAIRO-Opera Res. 2001;35(1):127\u201342.","journal-title":"RAIRO-Opera Res"},{"issue":"2","key":"1017_CR17","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ejor.2012.02.019","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107 N, Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M. Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur J Oper Res. 2012;220(2):328\u201337.","journal-title":"Eur J Oper Res"},{"key":"1017_CR18","doi-asserted-by":"crossref","unstructured":"Ivanovi\u0107 M, Uro\u0161evi\u0107 D. Variable neighborhood search approach for solving roman and weak roman domination problems on graphs. Comput Inf. 2019;38(1).","DOI":"10.31577\/cai_2019_1_57"},{"issue":"5","key":"1017_CR19","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1109\/TCBB.2019.2898189","volume":"17","author":"M Grbi\u0107","year":"2019","unstructured":"Grbi\u0107 M, Kartelj A, Jankovi\u0107 S, Mati\u0107 D, Filipovi\u0107 V. Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k k-Plexes. IEEE\/ACM Trans Comput Biol Bioinf. 2019;17(5):1822\u201331.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"2","key":"1017_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2298\/CSIS160320012M","volume":"14","author":"D Matic","year":"2014","unstructured":"Matic D, Kratica J, Filipovic V. Variable Neighborhood Search for solving Bandwidth Coloring Problem. Comput Sci Inf Syst. 2014;14(2):309\u201327.","journal-title":"Comput Sci Inf Syst"},{"key":"1017_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.endm.2012.10.022","volume":"39","author":"D Mati\u0107","year":"2012","unstructured":"Mati\u0107 D, Kratica J, Filipovi\u0107 V, Dugo\u0161ija D. Variable neighborhood search for multiple level warehouse layout problem. Electron Notes Discrete Math. 2012;39:161\u20138.","journal-title":"Electron Notes Discrete Math."},{"issue":"2","key":"1017_CR22","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1016\/j.asoc.2012.10.015","volume":"13","author":"V Filipovi\u0107","year":"2013","unstructured":"Filipovi\u0107 V, Kartelj A, Mati\u0107 D. An electromagnetism metaheuristic for solving the maximum betweenness problem. Appl Soft Comput. 2013;13(2):1303\u201313.","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1017_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1108\/K-06-2013-0105","volume":"43","author":"A Kartelj","year":"2014","unstructured":"Kartelj A, \u0160urlan N, Ceki\u0107 Z. Case-based reasoning and electromagnetism-like method in construction management. Kybernetes. 2014;43(2):265\u201380.","journal-title":"Kybernetes"},{"key":"1017_CR24","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10732-019-09409-w","volume":"25","author":"F Glover","year":"2019","unstructured":"Glover F, Samorani M. Intensification, Diversification and Learning in metaheuristic optimization. J Heuristics. 2019;25:517\u201320.","journal-title":"J Heuristics."},{"issue":"1","key":"1017_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG. No free lunch theorems for optimization. IEEE Trans Evol Comput. 1997;1(1):67\u201382.","journal-title":"IEEE Trans Evol Comput"},{"key":"1017_CR26","doi-asserted-by":"crossref","unstructured":"Pitzer E, Affenzeller M. A comprehensive survey on fitness landscape analysis. In: Recent advances in intelligent engineering systems. 2012; p. 161\u2013191.","DOI":"10.1007\/978-3-642-23229-9_8"},{"key":"1017_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383","volume-title":"Parallel metaheuristics: a new class of algorithms","author":"E Alba","year":"2005","unstructured":"Alba E. Parallel metaheuristics: a new class of algorithms. New York: Wiley; 2005."},{"key":"1017_CR28","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez F, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Moreno-Vega JM. The parallel variable neighborhood search for the p-median problem. J Heuristics. 2002;8:375\u201388.","journal-title":"J Heuristics."},{"issue":"1","key":"1017_CR29","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1111\/itor.12510","volume":"27","author":"A Herr\u00e1n","year":"2020","unstructured":"Herr\u00e1n A, Colmenar JM, Mart\u00ed R, Duarte A. A parallel variable neighborhood search approach for the obnoxious p-median problem. Int Trans Oper Res. 2020;27(1):336\u201360.","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"1017_CR30","first-page":"143","volume":"22","author":"V Filipovi\u0107","year":"2003","unstructured":"Filipovi\u0107 V. Fine-grained tournament selection operator in genetic algorithms. Comput Inf. 2003;22(2):143\u201361.","journal-title":"Comput Inf"},{"key":"1017_CR31","first-page":"2440","volume":"711","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Hansen P, Mladenovic N. Convergence of variable neighborhood search. Les Cahiers du GERAD ISSN. 2000;711:2440.","journal-title":"Les Cahiers du GERAD ISSN."},{"key":"1017_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101456","volume":"84","author":"H Jia","year":"2024","unstructured":"Jia H, Lu C, Xing Z. Memory backtracking strategy: an evolutionary updating mechanism for meta-heuristic algorithms. Swarm Evol Comput. 2024;84: 101456.","journal-title":"Swarm Evol Comput"},{"key":"1017_CR33","doi-asserted-by":"crossref","unstructured":"Kahle M. Topology of random simplicial complexes: a survey. In: Algebraic Topology: Applications and New Directions; 2014. p. 201\u201321.","DOI":"10.1090\/conm\/620\/12367"},{"key":"1017_CR34","doi-asserted-by":"crossref","unstructured":"Zomorodian A, Carlsson G. Computing persistent homology. In: Proceedings of the twentieth annual symposium on Computational geometry; 2004. p. 347\u2013356.","DOI":"10.1145\/997817.997870"},{"issue":"2","key":"1017_CR35","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","volume":"46","author":"G Carlsson","year":"2009","unstructured":"Carlsson G. Topology and data. Bull Am Math Soc. 2009;46(2):255\u2013308.","journal-title":"Bull Am Math Soc"},{"issue":"1","key":"1017_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-016-0009-6","volume":"8","author":"Y Lee","year":"2017","unstructured":"Lee Y, Barthel SD, D\u0142otko P, Moosavi SM, Hess K, Smit B. Quantifying similarity of pore-geometry in nanoporous materials. Nat Commun. 2017;8(1):1\u20138.","journal-title":"Nat Commun"},{"issue":"1","key":"1017_CR37","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1515\/cmb-2022-0142","volume":"10","author":"J Liu","year":"2022","unstructured":"Liu J, Chen D, Li J, Wu J. Neighborhood hypergraph model for topological data analysis. Comput Math Biophys. 2022;10(1):262\u201380.","journal-title":"Comput Math Biophys."},{"key":"1017_CR38","unstructured":"Ghrist RW. Elementary applied topology. vol.\u00a01. Createspace Seattle; 2014."},{"issue":"7","key":"1017_CR39","doi-asserted-by":"publisher","first-page":"5169","DOI":"10.1007\/s10462-022-10146-z","volume":"55","author":"CS Pun","year":"2022","unstructured":"Pun CS, Lee SX, Xia K. Persistent-homology-based machine learning: a survey and a comparative study. Artif Intell Rev. 2022;55(7):5169\u2013213.","journal-title":"Artif Intell Rev"},{"key":"1017_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101448","volume":"84","author":"G Petelin","year":"2024","unstructured":"Petelin G, Cenikj G, Eftimov T. TinyTLA: topological landscape analysis for optimization problem classification in a limited sample setting. Swarm Evol Comput. 2024;84: 101448.","journal-title":"Swarm Evol Comput"},{"key":"1017_CR41","unstructured":"Kartelj A, Filipovi\u0107 V, Vre\u0107ica S, \u017divaljevi\u0107 R. Topologically sensitive metaheuristics. arXiv preprint arXiv:2002.11164. 2020."},{"issue":"11","key":"1017_CR42","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P. Variable neighborhood search. Comput Opera Res. 1997;24(11):1097\u2013100.","journal-title":"Comput Opera Res."},{"key":"1017_CR43","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, Brimberg J, P\u00e9rez JAM. In: Gendreau M, Potvin JY, editors. Variable neighborhood search. Cham: Springer International Publishing; 2019. p. 57\u201397.","DOI":"10.1007\/978-3-319-91086-4_3"},{"issue":"3","key":"1017_CR44","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N. Variable neighborhood search: principles and applications. Eur J Oper Res. 2001;130(3):449\u201367.","journal-title":"Eur J Oper Res"},{"key":"1017_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106221","volume":"155","author":"J Brimberg","year":"2023","unstructured":"Brimberg J, Salhi S, Todosijevi\u0107 R, Uro\u0161evi\u0107 D. Variable neighborhood search: the power of change and simplicity. Comput Opera Res. 2023;155: 106221.","journal-title":"Comput Opera Res"},{"key":"1017_CR46","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10898-013-0094-6","volume":"63","author":"F Colombo","year":"2015","unstructured":"Colombo F, Cordone R, Lulli G. A variable neighborhood search algorithm for the multimode set covering problem. J Global Optim. 2015;63:461\u201380.","journal-title":"J Global Optim"},{"issue":"9","key":"1017_CR47","doi-asserted-by":"publisher","first-page":"9797","DOI":"10.1109\/TCYB.2021.3070143","volume":"52","author":"X Xu","year":"2021","unstructured":"Xu X, Li J, Zhou M, Yu X. Precedence-constrained colored traveling salesman problem: an augmented variable neighborhood search approach. IEEE Trans Cybernet. 2021;52(9):9797\u2013808.","journal-title":"IEEE Trans Cybernet"},{"issue":"3","key":"1017_CR48","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis Y, Migdalas A, Sifaleras A. A hybrid particle swarm optimization-variable neighborhood search algorithm for constrained shortest path problems. Eur J Oper Res. 2017;261(3):819\u201334.","journal-title":"Eur J Oper Res"},{"key":"1017_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103194","volume":"278","author":"A Ouali","year":"2020","unstructured":"Ouali A, Allouche D, de Givry S, Loudni S, Lebbah Y, Loukil L, et al. Variable neighborhood search for graphical model energy minimization. Artif Intell. 2020;278: 103194.","journal-title":"Artif Intell"},{"key":"1017_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107838","volume":"112","author":"S Perez-Pelo","year":"2021","unstructured":"Perez-Pelo S, Sanchez-Oro J, Gonzalez-Pardo A, Duarte A. A fast variable neighborhood search approach for multi-objective community detection. Appl Soft Comput. 2021;112: 107838.","journal-title":"Appl Soft Comput"},{"key":"1017_CR51","unstructured":"Filipovi\u0107 V, Mati\u0107 D, Kartelj A. Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods. arXiv preprint arXiv:2201.00394. 2022."},{"key":"1017_CR52","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S. In: Gendreau M, Potvin JY, editors. Large neighborhood search. Cham: Springer International Publishing; 2019. p. 99\u2013127.","DOI":"10.1007\/978-3-319-91086-4_4"},{"issue":"8","key":"1017_CR53","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard \u00c9. Parallel iterative search methods for vehicle routing problems. Networks. 1993;23(8):661\u201373.","journal-title":"Networks"},{"issue":"7","key":"1017_CR54","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1080\/00029890.2000.12005243","volume":"107","author":"CS ReVelle","year":"2000","unstructured":"ReVelle CS, Rosing KE. Defendens imperium romanum: a classical problem in military strategy. Am Math Mon. 2000;107(7):585\u201394.","journal-title":"Am Math Mon"},{"issue":"1\u20133","key":"1017_CR55","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne EJ, Dreyer PA Jr, Hedetniemi SM, Hedetniemi ST. Roman domination in graphs. Discret Math. 2004;278(1\u20133):11\u201322.","journal-title":"Discret Math"},{"key":"1017_CR56","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.dam.2016.12.013","volume":"231","author":"M Alvarez-Ruiz","year":"2017","unstructured":"Alvarez-Ruiz M, Mediavilla-Gradolph T, Sheikholeslami SM, Valenzuela-Tripodoro J, Yero IG. On the strong Roman domination number of graphs. Discret Appl Math. 2017;231:44\u201359.","journal-title":"Discret Appl Math"},{"key":"1017_CR57","volume-title":"Applications and variations of domination in graphs","author":"PA Dreyer Jr","year":"2000","unstructured":"Dreyer PA Jr. Applications and variations of domination in graphs. School of Graduate Studies: Rutgers The State University of New Jersey; 2000."},{"key":"1017_CR58","first-page":"103","volume-title":"International workshop on graph-theoretic concepts in computer science","author":"M Liedloff","year":"2005","unstructured":"Liedloff M, Kloks T, Liu J, Peng SL. Roman domination over some graph classes. In: International workshop on graph-theoretic concepts in computer science. Berlin: Springer; 2005. p. 103\u201314."},{"issue":"2","key":"1017_CR59","doi-asserted-by":"publisher","first-page":"393","DOI":"10.2298\/AADM171211019K","volume":"15","author":"A Kartelj","year":"2021","unstructured":"Kartelj A, Grbi\u0107 M, Mati\u0107 D, Filipovi\u0107 V. The roman domination number of some special classes of graphs-convex polytopes. Appl Anal Discret Math. 2021;15(2):393\u2013412.","journal-title":"Appl Anal Discret Math"},{"issue":"2","key":"1017_CR60","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","volume":"27","author":"H Abdollahzadeh Ahangar","year":"2014","unstructured":"Abdollahzadeh Ahangar H, Henning MA, L\u00f6wenstein C, Zhao Y, Samodivkin V. Signed Roman domination in graphs. J Comb Optim. 2014;27(2):241\u201355.","journal-title":"J Comb Optim"},{"key":"1017_CR61","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s10878-015-9906-6","volume":"32","author":"L Volkmann","year":"2016","unstructured":"Volkmann L. Signed total Roman domination in graphs. J Comb Optim. 2016;32:855\u201371.","journal-title":"J Comb Optim"},{"issue":"113","key":"1017_CR62","doi-asserted-by":"publisher","first-page":"51","DOI":"10.2298\/PIM1613051I","volume":"99","author":"M Ivanovi\u0107","year":"2016","unstructured":"Ivanovi\u0107 M. Improved mixed integer linear programing formulations for roman domination problem. Publications de l\u2019Institut Mathematique. 2016;99(113):51\u20138.","journal-title":"Publications de l\u2019Institut Mathematique."},{"key":"1017_CR63","doi-asserted-by":"crossref","unstructured":"Greilhuber J, Schober S, Iurlano E, Raidl GR. A Simulated Annealing Based Approach for the Roman Domination Problem. In: 9th International Conference on Metaheuristics and Nature Inspired Computing (META); 2023.","DOI":"10.1007\/978-3-031-69257-4_3"},{"issue":"4","key":"1017_CR64","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/21M1409512","volume":"65","author":"RC Tillquist","year":"2023","unstructured":"Tillquist RC, Frongillo RM, Lladser ME. Getting the lay of the land in discrete space: A survey of metric dimension and its applications. SIAM Rev. 2023;65(4):919\u201362.","journal-title":"SIAM Rev"},{"key":"1017_CR65","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J Opatrny","year":"1979","unstructured":"Opatrny J. Total ordering problem. SIAM J Comput. 1979;8:111\u20134.","journal-title":"SIAM J Comput"},{"issue":"3","key":"1017_CR66","doi-asserted-by":"publisher","first-page":"299p","DOI":"10.55630\/sjc.2009.3.299-308","volume":"3","author":"A Savi\u0107","year":"2009","unstructured":"Savi\u0107 A. On solving the maximum betweenness problem using genetic algorithms. Serdica J Comput. 2009;3(3):299p\u2013308p.","journal-title":"Serdica J Comput"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-024-01017-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-024-01017-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-024-01017-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T09:06:33Z","timestamp":1734685593000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-024-01017-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,20]]},"references-count":66,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1017"],"URL":"https:\/\/doi.org\/10.1186\/s40537-024-01017-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4351551\/v1","asserted-by":"object"}]},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,20]]},"assertion":[{"value":"30 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"178"}}