{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:54Z","timestamp":1740145134820,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T00:00:00Z","timestamp":1657152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T00:00:00Z","timestamp":1657152000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-022-01904-7","type":"journal-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T13:04:00Z","timestamp":1657199040000},"page":"2087-2111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["General variable neighborhood search approach to group steiner tree problem"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4575-6720","authenticated-orcid":false,"given":"Luka","family":"Matijevi\u0107","sequence":"first","affiliation":[]},{"given":"Slobodan","family":"Jeli\u0107","sequence":"additional","affiliation":[]},{"given":"Tatjana","family":"Davidovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"1904_CR1","doi-asserted-by":"crossref","unstructured":"Reich, G., Widmayer, P.: Beyond steiner\u2019s problem: a vlsi oriented generalization. In: International Workshop on Graph-theoretic Concepts in Computer Science, vol. LNCS, Vol. 411, pp. 196\u2013210. Springer (1990)","DOI":"10.1007\/3-540-52292-1_14"},{"key":"1904_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-53832-1_36","volume-title":"Graph-theoretic concepts in computer science. Lecture Notes in computer science","author":"E Ihler","year":"1991","unstructured":"Ihler, E.: Bounds on the quality of approximate solutions to the group Steiner problem. In: M\u00f6hring, R.H. (ed.) Graph-theoretic concepts in computer science. Lecture Notes in computer science, pp. 109\u2013118. Springer, Berlin (1991). https:\/\/doi.org\/10.1007\/3-540-53832-1_36"},{"issue":"1","key":"1904_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0377-2217(02)00707-5","volume":"154","author":"CW Duin","year":"2004","unstructured":"Duin, C.W., Volgenant, A., Vo\u00df, S.: Solving group steiner problems as steiner problems. Eur. J. Oper. Res. 154(1), 323\u2013329 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"1904_CR4","doi-asserted-by":"crossref","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 467\u2013476 (2009)","DOI":"10.1145\/1557019.1557074"},{"issue":"3","key":"1904_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s10100-017-0505-8","volume":"26","author":"S Jeli\u0107","year":"2018","unstructured":"Jeli\u0107, S., \u0160everdija, D.: Government formation problem. CEJOR 26(3), 659\u2013672 (2018)","journal-title":"CEJOR"},{"issue":"1","key":"1904_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/TKDE.2012.228","volume":"26","author":"J Coffman","year":"2014","unstructured":"Coffman, J., Weaver, A.C.: An empirical performance evaluation of relational keyword search systems. IEEE Trans. Knowl. Data Eng. 26(1), 30\u201342 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1904_CR7","doi-asserted-by":"publisher","unstructured":"Nguyen, T.-D., Do, P.-T.: An ant colony optimization algorithm for solving Group Steiner Problem. In: The 2013 RIVF International Conference on Computing Communication Technologies - Research, Innovation, and Vision for Future (RIVF), pp. 163\u2013168. https:\/\/doi.org\/10.1109\/RIVF.2013.6719887 (2013)","DOI":"10.1109\/RIVF.2013.6719887"},{"key":"1904_CR8","doi-asserted-by":"publisher","unstructured":"\u010cori\u0107, R., \u0110umi\u0107, M., Jeli\u0107, S.: A genetic algorithm for Group Steiner Tree Problem. In: 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pp. 0944\u20130949. https:\/\/doi.org\/10.23919\/MIPRO.2018.8400173 (2018)","DOI":"10.23919\/MIPRO.2018.8400173"},{"key":"1904_CR9","doi-asserted-by":"publisher","DOI":"10.7232\/JKIIE.2011.37.3.191","author":"Y-S Myung","year":"2011","unstructured":"Myung, Y.-S.: A comparison of group steiner tree formulations. J. Korean Inst. Ind. Eng. (2011). https:\/\/doi.org\/10.7232\/JKIIE.2011.37.3.191","journal-title":"J. Korean Inst. Ind. Eng."},{"issue":"13","key":"1904_CR10","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.dam.2006.03.028","volume":"154","author":"CE Ferreira","year":"2006","unstructured":"Ferreira, C.E., de Oliveira Filho, F.M.: Some formulations for the group steiner tree problem. Discret. Appl. Math. 154(13), 1877\u20131884 (2006). https:\/\/doi.org\/10.1016\/j.dam.2006.03.028","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"1904_CR11","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. OR 24(11), 1097\u20131100 (1997)","journal-title":"Comput. OR"},{"key":"1904_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighbourhood search. In: Glover, F., Kochenagen, G. (eds.) Handbook of Metaheuristics, pp. 145\u2013184. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"3","key":"1904_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"1904_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications (invited survey). Ann. Oper. Res. 175, 367\u2013407 (2010). https:\/\/doi.org\/10.1007\/s10479-009-0657-6","journal-title":"Ann. Oper. Res."},{"key":"1904_CR15","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., Moreno P\u00e9rez, J.A.: Variable neighborhood search. In: Handbook of Metaheuristics, Updated edition of a trailblazing volume, Springer, Cham. pp. 57\u201397. (2019)","DOI":"10.1007\/978-3-319-91086-4_3"},{"issue":"4","key":"1904_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"Y-S Myung","year":"1995","unstructured":"Myung, Y.-S., Lee, C.-H., Tcha, D.-W.: On the generalized minimum spanning tree problem. Networks 26(4), 231\u2013241 (1995)","journal-title":"Networks"},{"issue":"1","key":"1904_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"MX Goemans","year":"1994","unstructured":"Goemans, M.X.: The Steiner tree polytope and related polyhedra. Math. Program. 63(1), 157\u2013182 (1994). https:\/\/doi.org\/10.1007\/BF01582064","journal-title":"Math. Program."},{"issue":"4","key":"1904_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-Perez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319\u2013360 (2008)","journal-title":"4OR"},{"key":"1904_CR19","volume-title":"Encyclopedia of Optimization","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search methods. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization. Springer, New York (2008)"},{"key":"1904_CR20","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-1-4615-1507-4_19","volume-title":"Essays and Surveys in Metaheuristics","author":"P Hansen","year":"2002","unstructured":"Hansen, P., Mladenovi\u0107, N.: Developments of the variable neighborhood search. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 415\u2013439. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"1904_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent. In: Marte, R., et al. (eds.) Handbook of Heuristics, pp. 341\u2013367. Springer, Cham (2018)"},{"issue":"2","key":"1904_CR22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107, R., Benmansour, R., Hanafi, S., Mladenovi\u0107, N., Artiba, A.: Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2), 385\u2013396 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"1904_CR23","first-page":"1","volume":"16","author":"P Karakostas","year":"2020","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem. Optim. Lett. 16, 1\u201325 (2020)","journal-title":"Optim. Lett."},{"key":"1904_CR24","doi-asserted-by":"crossref","unstructured":"Cavero, S., Pardo, E.G., Duarte, A.: A general variable neighborhood search for the cyclic antibandwidth problem. Comput. Optim. Appl., 1\u201331 (2022)","DOI":"10.1016\/j.knosys.2022.108680"},{"key":"1904_CR25","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 211\u2013238. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/0-387-28356-0_8. Accessed 2020-12-03 (2005)","DOI":"10.1007\/0-387-28356-0_8"},{"issue":"3","key":"1904_CR26","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","volume":"120","author":"M Dror","year":"2000","unstructured":"Dror, M., Haouari, M., Chaouachi, J.: Generalized spanning trees. Eur. J. Oper. Res. 120(3), 583\u2013592 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00006-5","journal-title":"Eur. J. Oper. Res."},{"key":"1904_CR27","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Op. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Op. Res. Perspect."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01904-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01904-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01904-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:04:29Z","timestamp":1698663869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01904-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,7]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1904"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01904-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,7,7]]},"assertion":[{"value":"1 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}