{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:59:32Z","timestamp":1725703172904},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326493"},{"type":"electronic","value":"9783642326509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32650-9_6","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T18:19:21Z","timestamp":1349288361000},"page":"61-72","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Algorithms for the Minimum-Weight Rooted Arborescence Problem"],"prefix":"10.1007","author":[{"given":"Sergi","family":"Mateo","sequence":"first","affiliation":[]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Fua","sequence":"additional","affiliation":[]},{"given":"Engin","family":"T\u00fcretgen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2005.11.005","volume":"177","author":"C. Blum","year":"2007","unstructured":"Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research\u00a0177(1), 102\u2013114 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics \u2013 Part B\u00a034(2), 1161\u20131172 (2004)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics \u2013 Part B"},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","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. Applied Soft Computing\u00a011(6), 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"key":"6_CR4","doi-asserted-by":"publisher","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 (2004)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","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\u00a051(1), 34\u201347 (2008)","journal-title":"Networks"},{"issue":"8","key":"6_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: \n \n \n \n $\\mathcal{MAX-MIN}$\n Ant System. Future Generation Computer Systems\u00a016(8), 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"unstructured":"T\u00fcretken, E., Benmansour, F., Fua, P.: Automated reconstruction of tree structures using path classifiers and mixed integer programming. In: Proceedings of CVPR 2012 \u2013 25th IEEE Conference on Computer Vision and Pattern Recognition. IEEE Press (in press, 2012)","key":"6_CR7"},{"issue":"2-3","key":"6_CR8","doi-asserted-by":"publisher","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\u00a09(2-3), 279\u2013302 (2011)","journal-title":"Neuroinformatics"},{"key":"6_CR9","volume-title":"Graph Theory","author":"W.T. Tutte","year":"2001","unstructured":"Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (2001)"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","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\u00a039(2), 77\u201387 (2002)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32650-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T04:25:27Z","timestamp":1557203127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32650-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326493","9783642326509"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32650-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}