{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:46:31Z","timestamp":1725518791113},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875260"},{"type":"electronic","value":"9783540875277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87527-7_6","type":"book-chapter","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T06:14:06Z","timestamp":1221804846000},"page":"60-71","source":"Crossref","is-referenced-by-count":14,"title":["Finding Minimum Spanning\/Distances Trees by Using River Formation Dynamics"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Rabanal","sequence":"first","affiliation":[]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","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 Transactions on Systems, Man and Cybernetics, Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B"},{"key":"6_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems\u00a043(2), 73\u201381 (1997)","journal-title":"BioSystems"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-73554-0_16","volume-title":"Unconventional Computation","author":"P. Rabanal","year":"2007","unstructured":"Rabanal, P., Rodr\u00edguez, I., Rubio, F.: Using river formation dynamics to design heuristic algorithms. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds.) UC 2007. LNCS, vol.\u00a04618, pp. 163\u2013177. Springer, Heidelberg (2007)"},{"key":"6_CR5","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)"},{"key":"6_CR6","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"6_CR7","unstructured":"Rabanal, P., Rodr\u00edguez, I., Rubio, F.: MDV and MSV NP-completeness proof (2008), \n                    \n                      http:\/\/kimba.mat.ucm.es\/~fernando\/mdvmsv.pdf"},{"issue":"4598","key":"6_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick Jr.","year":"1983","unstructured":"Kirkpatrick Jr., S., Gelatt, C.D., Vecchi, M.: Optimization by Simulated Annealing. Science\u00a0220(4598), 671 (1983)","journal-title":"Science"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Fleischer, M.: Simulated annealing: past, present, and future. In: Proceedings of the 27th conference on Winter simulation, pp. 155\u2013161 (1995)","DOI":"10.1145\/224401.224457"},{"issue":"8","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE\u00a084(8), 1090\u20131123 (1996)","journal-title":"Proceedings of the IEEE"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1143997.1144000","volume-title":"GECCO","author":"T. Bui","year":"2006","unstructured":"Bui, T., Zrncic, C.: An ant-based algorithm for finding degree-constrained minimum spanning tree. In: GECCO, pp. 11\u201318. ACM Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87527-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T12:00:22Z","timestamp":1619524822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87527-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540875260","9783540875277"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87527-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}