{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:18:53Z","timestamp":1725574733552},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262084"},{"type":"electronic","value":"9783540321064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494669_4","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T14:48:09Z","timestamp":1294930089000},"page":"25-33","source":"Crossref","is-referenced-by-count":9,"title":["Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"Maria","family":"Blesa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Blesa, M., Moscato, P., Xhafa, F.: A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem. In: Proc.\u00a0of the 4th Metah.\u00a0Intern.\u00a0Conf., vol.\u00a01, pp. 85\u201390 (2001)"},{"key":"4_CR2","unstructured":"Blesa, M., Xhafa, F.: A C++ implementation of tabu search for k-cardinality tree problem based on generic programming and component reuse. In: Net.ObjectDays 2000 Tagungsband, Erfurt, Germany, pp. 648\u2013652 (2000)"},{"key":"4_CR3","unstructured":"Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. Tech. Rep.\u00a0LSI-04-57, Universitat Polit\u00e8cnica Catalunya, Spain (2004) (submitted)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/j.cor.2003.11.007","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C., Blesa, M.: New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research\u00a032, 1355\u20131377 (2005)","journal-title":"Computers & Operations Research"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0166-218X(02)00548-6","volume":"128","author":"C. Blum","year":"2003","unstructured":"Blum, C., Ehrgott, M.: Local search algorithms for the k-cardinality tree problem. Discr. Appl. Math.\u00a0128, 511\u2013540 (2003)","journal-title":"Discr. Appl. Math."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Brimberg, J., Uro\u0161evi\u0107, D., Mladenovi\u0107, N.: Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur. J. of Op. Res. (2005) (in press)","DOI":"10.1016\/j.ejor.2004.07.061"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-24854-5_4","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"T.N. Bui","year":"2004","unstructured":"Bui, T.N., Sundarraj, G.: Ant system for the k-cardinality tree problem. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 36\u201347. Springer, Heidelberg (2004)"},{"key":"4_CR8","volume-title":"Proceedings of INFOCOM 1994","author":"S.Y. Cheung","year":"1994","unstructured":"Cheung, S.Y., Kumar, A.: Efficient quorumcast routing algorithms. In: Proceedings of INFOCOM 1994. IEEE Society Press, Los Alamitos (1994)"},{"key":"4_CR9","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms (in Italian). PhD, Dipartimento di Elettronica, Politecnico di Milano, Italy (1992)"},{"key":"4_CR10","first-page":"29","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a colony of cooperating agents. IEEE TSMC \u2013 Part B\u00a026, 29\u201341 (1996)","journal-title":"IEEE TSMC \u2013 Part B"},{"key":"4_CR11","first-page":"214","volume":"1","author":"M. Ehrgott","year":"1996","unstructured":"Ehrgott, M., Freitag, J.: K_TREE \/ K_SUBGRAPH: A program package for minimal weighted k-cardinality-trees and -subgraphs. Eur. J. of.\u00a0Op.\u00a0Res.\u00a01, 214\u2013225 (1996)","journal-title":"Eur. J. of.\u00a0Op.\u00a0Res."},{"key":"4_CR12","first-page":"87","volume":"14","author":"M. Ehrgott","year":"1997","unstructured":"Ehrgott, M., Freitag, J., Hamacher, H.W., Maffioli, F.: Heuristics for the k-cardinality tree and subgraph problem. Asia-Pac.\u00a0J.\u00a0of Op.\u00a0Res.\u00a014, 87\u2013114 (1997)","journal-title":"Asia-Pac.\u00a0J.\u00a0of Op.\u00a0Res."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230240103","volume":"24","author":"M. Fischetti","year":"1994","unstructured":"Fischetti, M., Hamacher, H.W., J\u00f8rnsten, K., Maffioli, F.: Weighted k-cardinality trees: Complexity and polyhedral structure. Networks\u00a024, 11\u201321 (1994)","journal-title":"Networks"},{"key":"4_CR14","unstructured":"Freitag, J.: Minimal k-cardinality trees (in German). Master\u2019s thesis, Department of Mathematics, University of Kaiserslautern, Germany (1993)"},{"key":"4_CR15","first-page":"9","volume":"14","author":"K. J\u00f6rnsten","year":"1997","unstructured":"J\u00f6rnsten, K., L\u00f8kketangen, A.: Tabu search for weighted k-cardinality trees. Asia-Pac.\u00a0J.\u00a0of Op.\u00a0Res\u00a014, 9\u201326 (1997)","journal-title":"Asia-Pac.\u00a0J.\u00a0of Op.\u00a0Res"},{"key":"4_CR16","unstructured":"Maffioli, F.: Finding a best subtree of a tree. Tech. Rep. 91.041, Politecnico di Milano, Dipartimento di Elettronica, Italy (1991)"},{"key":"4_CR17","unstructured":"Uehara, R.: The number of connected components in graphs and its applications. IEICE Tech. Rep. COMP99-10, Komazawa University, Japan (1999)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1016\/S0305-0548(03)00073-X","volume":"31","author":"D. Uro\u0161evi\u0107","year":"2004","unstructured":"Uro\u0161evi\u0107, D., Brimberg, J., Mladenovi\u0107, N.: Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comp. & Op. Res.\u00a031, 1205\u20131213 (2004)","journal-title":"Comp. & Op. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinspired Systems"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/11494669_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:31Z","timestamp":1605643171000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/11494669_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262084","9783540321064"],"references-count":18,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/11494669_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}