{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:12Z","timestamp":1759847172278},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,3,12]],"date-time":"2015-03-12T00:00:00Z","timestamp":1426118400000},"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":["J Heuristics"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10732-015-9286-1","type":"journal-article","created":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T05:55:17Z","timestamp":1426053317000},"page":"479-499","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A matheuristic for the minimum weight rooted arborescence problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borja","family":"Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,12]]},"reference":[{"key":"9286_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Finding tours in the TSP. Techical Report, Forschungsinstitut f\u00fcr Diskrete Mathematik, University of Bonn, Germany (1999)"},{"issue":"6","key":"9286_CR2","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"9286_CR3","doi-asserted-by":"crossref","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., Boluf\u00e9 R\u00f6hler, A.: Matheuristics: Optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) Proceedings of the HM 2009 Sixth International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 5818, pp. 171\u2013177. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04918-7_13"},{"issue":"3","key":"9286_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W Cook","year":"2003","unstructured":"Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(3), 233\u2013248 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"8","key":"9286_CR5","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.comcom.2010.01.006","volume":"33","author":"D Coudert","year":"2010","unstructured":"Coudert, D., Nepomuceno, N., Rivano, H.: Power-efficient radio configuration in fixed broadband wireless networks. Comput. Commun. 33(8), 898\u2013906 (2010)","journal-title":"Comput. Commun."},{"key":"9286_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge, MA (2004)"},{"issue":"1","key":"9286_CR7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/net.20194","volume":"51","author":"C Duhamel","year":"2008","unstructured":"Duhamel, C., Gouveia, L., Moura, P., Souza, M.: Models and heuristics for a minimum arborescence problem. Networks 51(1), 34\u201347 (2008)","journal-title":"Networks"},{"key":"9286_CR8","doi-asserted-by":"crossref","unstructured":"Klau, G.W., Ljubi\u0107, I., Moser, A., Mutzel, P., Neuner, P., Pferschy, U., Raidl, G., Weiskircher, R.: Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. In: Proceedings of the GECCO 2004 -Genetic and Evolutionary Computation Conference. Lecture Notes in Computer Science, vol. 3102, pp. 1304\u20131315. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24854-5_125"},{"key":"9286_CR9","doi-asserted-by":"crossref","unstructured":"Mateo, S., Blum, C, T\u00fcretken, E., Fua, P.: Hybrid algorithms for the minimum-weight rooted arborescence problem. In: Dorigo M, Birattari M, Blum C, Christensen AL, Engelbrecht AP, Gro\u00df R, St\u00fctzle T (eds) Proceedings of ANTS 2012\u20138th International Conference on Swarm Intelligence. Lecture Notes in Computer Science, vol. 7461, pp. 61\u201372. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32650-9_6"},{"key":"9286_CR10","doi-asserted-by":"crossref","unstructured":"Nepomuceno, N., Pinheiro, P., Coelho, A.L.V.: A Hybrid Optimization Framework for Cutting and Packing Problems. Recent Advances in Evolutionary Computation for Combinatorial Optimization, Studies in Computational Intelligence, vol. 153, pp. 87\u201399. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-70807-0_6"},{"issue":"3","key":"9286_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.cie.2011.03.013","volume":"61","author":"PR Pinheiro","year":"2011","unstructured":"Pinheiro, P.R., Coelho, A.L.V., de Aguiar, A.B., Bonates, T.O.: On the concept of density control and its application to a hybrid optimization framework: investigation into cutting problems. Comput. Industr. Eng. 61(3), 463\u2013472 (2011)","journal-title":"Comput. Industr. Eng."},{"key":"9286_CR12","unstructured":"Raidl, G.R.: Decomposition based hybrid metaheuristics. Eur. J. Oper. Res. (2014). In press"},{"key":"9286_CR13","series-title":"Studies in Computational Intelligence","volume-title":"Hybrid Metaheuristics","year":"2013","unstructured":"Talbi, E.G. (ed.): Hybrid Metaheuristics. Studies in Computational Intelligence. Springer, Berlin (2013)"},{"issue":"2\u20133","key":"9286_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s12021-011-9122-1","volume":"9","author":"E T\u00fcretken","year":"2011","unstructured":"T\u00fcretken, E., Gonz\u00e1lez, G., Blum, C., Fua, P.: Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9(2\u20133), 279\u2013302 (2011)","journal-title":"Neuroinformatics"},{"key":"9286_CR15","volume-title":"Graph Theory","author":"WT Tutte","year":"2001","unstructured":"Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (2001)"},{"key":"9286_CR16","unstructured":"Venkata Rao, V., Sridharan, R.: The minimum weight rooted arborescence problem: weights on arcs case. Technical Report, Indian Institute of Management Ahmedabad, Research and Publication Department (1992)"},{"issue":"2","key":"9286_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.10015","volume":"39","author":"V Venkata Rao","year":"2002","unstructured":"Venkata Rao, V., Sridharan, R.: Minimum-weight rooted not-necessarily-spanning arborescence problem. Networks 39(2), 77\u201387 (2002)","journal-title":"Networks"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9286-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9286-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9286-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T21:22:08Z","timestamp":1566422528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9286-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9286"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9286-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,12]]}}}