{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:41:11Z","timestamp":1761597671486,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T00:00:00Z","timestamp":1453161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Prog Artif Intell"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s13748-015-0076-7","type":"journal-article","created":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T06:55:26Z","timestamp":1453186526000},"page":"121-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel strategic oscillation: an application to the maximum leaf spanning tree problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borja","family":"Men\u00e9ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,19]]},"reference":[{"key":"76_CR1","doi-asserted-by":"crossref","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, vol. 47. Wiley, New York (2005)"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Handbook of Optimization in Telecommunications, pp. 865\u2013890. Springer, New York (2006)","DOI":"10.1007\/978-0-387-30165-5_30"},{"key":"76_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S Chen","year":"2010","unstructured":"Chen, S., Ljubi\u0107, I., Raghavan, S.: The regenerator location problem. Networks 55, 205\u2013220 (2010)","journal-title":"Networks"},{"key":"76_CR4","unstructured":"Chen, S., Raghavan, S.: The regenerator location problem. In: Proceedings of the 2007 International Network Optimization Conference (INOC\u201907) (2007)"},{"key":"76_CR5","volume-title":"CUDA Programming: A Developer\u2019s Guide to Parallel Computing with GPUs (Applications of GPU Computing)","author":"S Cook","year":"2012","unstructured":"Cook, S.: CUDA Programming: A Developer\u2019s Guide to Parallel Computing with GPUs (Applications of GPU Computing), 1st edn. Morgan Kaufmann Publishers Inc., San Francisco (2012)","edition":"1"},{"key":"76_CR6","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1007\/s00500-010-0650-7","volume":"15","author":"A Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Gort\u00e1zar, F.: Path relinking for large-scale global optimization. Soft Comput. 15, 2257\u20132273 (2011)","journal-title":"Soft Comput."},{"key":"76_CR7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1111\/itor.12085","volume":"21","author":"A Duarte","year":"2014","unstructured":"Duarte, A., Mart\u00ed, R., Resende, M., Silva, R.: Improved heuristics for the regenerator location problem. Int. Trans. Oper. Res. 21, 541\u2013558 (2014)","journal-title":"Int. Trans. Oper. Res."},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., S\u00e1nchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27, 55\u201373 (2016)","DOI":"10.1093\/imaman\/dpt026"},{"key":"76_CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/S0377-2217(96)00327-X","volume":"104","author":"LM Fernandes","year":"1998","unstructured":"Fernandes, L.M., Gouveia, L.: Minimal spanning trees with a constraint on the number of leaves. Eur. J. Oper. Res. 104, 250\u2013261 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Raible, D., Rossmanith, P.: An exact algorithm for the maximum leaf spanning tree problem. In: Parameterized and Exact Computation, pp. 161\u2013172. Springer, New York (2009)","DOI":"10.1007\/978-3-642-11269-0_13"},{"key":"76_CR11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32, 675\u2013701 (1937)","journal-title":"J. Am. Stat. Assoc."},{"key":"76_CR12","doi-asserted-by":"crossref","first-page":"1931","DOI":"10.1016\/S0305-0548(02)00117-X","volume":"30","author":"T Fujie","year":"2003","unstructured":"Fujie, T.: An exact algorithm for the maximum leaf spanning tree problem. Comput. Oper. Res. 30, 1931\u20131944 (2003)","journal-title":"Comput. Oper. Res."},{"key":"76_CR13","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1002\/net.20001","volume":"43","author":"T Fujie","year":"2004","unstructured":"Fujie, T.: The maximum-leaf spanning tree problem: formulations and facets. Networks 43, 212\u2013223 (2004)","journal-title":"Networks"},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Gao, G., Sato, M., Ayguad\u00e9, E.: Special issue on parallel programming with openmp. International Journal of Parallel Programming 36, (2008)","DOI":"10.1007\/s10766-008-0076-3"},{"key":"76_CR15","doi-asserted-by":"crossref","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, J., Moreno-Vega, J.: The parallel variable neighborhood search for the $$p$$ p -median problem. J. Heuristics 8, 375\u2013388 (2002)","journal-title":"J. Heuristics"},{"key":"76_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"76_CR17","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"76_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"key":"76_CR19","doi-asserted-by":"crossref","first-page":"1977","DOI":"10.1016\/j.cor.2010.01.013","volume":"37","author":"F Gort\u00e1zar","year":"2010","unstructured":"Gort\u00e1zar, F., Duarte, A., Laguna, M., Mart\u00ed, R.: Black box scatter search for general classes of binary optimization problems. Comput. Oper. Res. 37, 1977\u20131986 (2010)","journal-title":"Comput. Oper. Res."},{"key":"76_CR20","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"76_CR21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10898-013-0061-2","volume":"58","author":"M Laguna","year":"2014","unstructured":"Laguna, M., Gort\u00e1zar, F., Gallego, M., Duarte, A., Mart\u00ed, R.: A black-box scatter search for optimization problems with integer variables. J. Glob. Optim. 58, 497\u2013516 (2014)","journal-title":"J. Glob. Optim."},{"key":"76_CR22","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"HI Lu","year":"1998","unstructured":"Lu, H.I., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. J. Algorithms 29, 132\u2013141 (1998)","journal-title":"J. Algorithms"},{"key":"76_CR23","doi-asserted-by":"crossref","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. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"76_CR24","unstructured":"Oaks, S., Wong, H.: Java Threads. O\u2019Reilly Media (2004)"},{"key":"76_CR25","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Oro, J., Duarte, A.: Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem. In: Lecture Notes in Computer Science, vol. 9422. Springer, New York (2015)","DOI":"10.1007\/978-3-319-24598-0_29"},{"key":"76_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.endm.2014.11.012","volume":"47","author":"J S\u00e1nchez-Oro","year":"2015","unstructured":"S\u00e1nchez-Oro, J., Sevaux, M., Rossi, A., Mart\u00ed, R., Duarte, A.: Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. Electron. Notes Discret. Math. 47, 85\u201392 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"76_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-68530-8_37","volume-title":"2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves","author":"R Solis-Oba","year":"1998","unstructured":"Solis-Oba, R.: 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. Springer, New York (1998)"},{"key":"76_CR28","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0020-0190(81)90141-1","volume":"13","author":"JA Storer","year":"1981","unstructured":"Storer, J.A.: Constructing full spanning trees for cubic graphs. Inf. Process. Lett. 13, 8\u201311 (1981)","journal-title":"Inf. Process. Lett."},{"key":"76_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: from design to implementation. Wiley, New York (2009)"},{"key":"76_CR30","doi-asserted-by":"crossref","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6)80\u201383 (1945)","DOI":"10.2307\/3001968"}],"container-title":["Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-015-0076-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13748-015-0076-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13748-015-0076-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T21:30:41Z","timestamp":1718314241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13748-015-0076-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,19]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s13748-015-0076-7","relation":{},"ISSN":["2192-6352","2192-6360"],"issn-type":[{"type":"print","value":"2192-6352"},{"type":"electronic","value":"2192-6360"}],"subject":[],"published":{"date-parts":[[2016,1,19]]}}}