{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:52:14Z","timestamp":1725540734114},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048197"},{"type":"electronic","value":"9783642048203"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04820-3_29","type":"book-chapter","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T11:48:07Z","timestamp":1258458487000},"page":"315-326","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems"],"prefix":"10.1007","author":[{"given":"Hideki","family":"Katagiri","sequence":"first","affiliation":[]},{"given":"Tomohiro","family":"Hayashida","sequence":"additional","affiliation":[]},{"given":"Ichiro","family":"Nishizaki","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Ishimatsu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","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.J.: New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research\u00a032, 1355\u20131377 (2005)","journal-title":"Computers & Operations Research"},{"key":"29_CR2","unstructured":"B\u00f6rndorfer, R., Ferreira, C., Martin, A.: Matrix decomposition by branch- and-cut. Technical Report, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin (1997)"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/S1052623497318682","volume":"9","author":"R. B\u00f6rndorfer","year":"1998","unstructured":"B\u00f6rndorfer, R., Ferreira, C., Martin, A.: Decomposing matrices into blocks. SIAM Journal on Optimization\u00a09(1), 236\u2013269 (1998)","journal-title":"SIAM Journal on Optimization"},{"key":"29_CR4","volume-title":"Proceedings of INFOCOM","author":"S.Y. Cheung","year":"1994","unstructured":"Cheung, S.Y., Kumar, A.: Efficient quorum-cast routing algorithms. In: Proceedings of INFOCOM. IEEE Society Press, Los Alamitos (1994)"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Transactionson Systems, Man and Cybernetics: Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactionson Systems, Man and Cybernetics: Part B"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"29_CR7","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\u00f6rnsten, K., Maffioli, F.: Weighted k-cardinality trees: complexity and polyhedral structure. Networks\u00a024, 11\u201321 (1994)","journal-title":"Networks"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1023\/A:1018925728178","volume":"81","author":"L.R. Foulds","year":"1998","unstructured":"Foulds, L.R., Hamacher, H.W., Wilson, J.: Integer programming approaches to facilities layout models with forbidden areas. Annals of Operations Research\u00a081, 405\u2013417 (1998)","journal-title":"Annals of Operations Research"},{"key":"29_CR9","unstructured":"Freitag, J.: Minimal k-cardinality trees, Master thesis, Department of Mathematics, University of Kaiserslautern, Germany (1993)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02523691","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Hochbaum, D.: An O(logk) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica\u00a018(1), 111\u2013121 (1997)","journal-title":"Algorithmica"},{"key":"29_CR11","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, Dordrecht (1997)"},{"key":"29_CR12","unstructured":"Hamacher, H.W., J\u00f6rnsten, K., Maffioli, F.: Weighted k-cardinality trees. Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica, Italy (1991)"},{"issue":"2","key":"29_CR13","first-page":"9","volume":"14","author":"J. J\u00f6rnsten","year":"1997","unstructured":"J\u00f6rnsten, J., L\u00f8kketangen, A.: Tabu search for weighted k-cardinality trees. Asia-Pacific Journal of Operational Research\u00a014(2), 9\u201326 (1997)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"29_CR14","unstructured":"KCTLIB (2003), \n                      \n                        http:\/\/iridia.ulb.ac.be\/~cblum\/kctlib\/"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/S0895480194266331","volume":"9","author":"M.V. Marathe","year":"1996","unstructured":"Marathe, M.V., Ravi, R., Ravi, S.S., Rosenkrantz, D.J., Sundaram, R.: Spanning trees short or small. SIAM Journal on Discrete Mathematics\u00a09(2), 178\u2013200 (1996)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"29_CR16","volume-title":"On the optimal extraction of ore from an open-cast mine","author":"A.B. Philpott","year":"1997","unstructured":"Philpott, A.B., Wormald, N.C.: On the optimal extraction of ore from an open-cast mine. University of Auckland, New Zealand (1997)"}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04820-3_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:12:12Z","timestamp":1619781132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04820-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048197","9783642048203"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04820-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}