{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:45:13Z","timestamp":1742942713346,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642375019"},{"type":"electronic","value":"9783642375026"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37502-6_49","type":"book-chapter","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T08:25:55Z","timestamp":1367915155000},"page":"405-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Genetic Algorithm for Solving Optimal Communication Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Nguyen Duy","family":"Hiep","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,8]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"TC Hu","year":"1974","unstructured":"Hu TC (1974) Optimum communication spanning trees. SIAM J Comput 3:188\u2013195","journal-title":"SIAM J Comput"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"DS Johnson","year":"1978","unstructured":"Johnson DS, Lenstra JK, Kan AHGR (1978) The complexity of the network design problem. Networks 8:279\u2013285 Winter 1978","journal-title":"Networks"},{"unstructured":"Reshef E (1999) Approximating minimum communication cost spanning trees and related problems. In Master\u2019s thesis, Feinberg Graduate School of the Weizmann Institute of Science, Rehovot 76100, Israel","key":"49_CR3"},{"issue":"3","key":"49_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/trsc.21.3.163","volume":"21","author":"RK Ahuja","year":"1987","unstructured":"Ahuja RK, Murty VVS (1987) Exact and heuristic algorithms for the optimum communication spanning tree problem. Transp Sci 21(3):163\u2013170","journal-title":"Transp Sci"},{"unstructured":"Palmer CC, Kershenbaum A (1994) Representing trees in genetic algorithms. In: Proceedings of the 1st IEEE conference on evolutionary computation, vol 1, IEE Service Center, Piscataway, NJ, pp 379\u2013384","key":"49_CR5"},{"issue":"10","key":"49_CR6","doi-asserted-by":"publisher","first-page":"2882","DOI":"10.1093\/ietfec\/e89-a.10.2882","volume":"89","author":"SM Soak","year":"2006","unstructured":"Soak SM (2006) New evolutionary approach for the optimal communication spanning tree problem. IEICE Trans 89(10):2882\u20132893","journal-title":"IEICE Trans"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-75514-2_13","volume-title":"HM: 4th international workshop on hybrid metaheuristics","author":"T Fischer","year":"2007","unstructured":"Fischer T, Merz P (2007) A memetic algorithm for the optimum communication spanning tree problem. In: Bartz-Beielstein T, Aguilera M, Blum C, Naujoks B, Roli A, Rudolph G, Sampels M (eds) HM: 4th international workshop on hybrid metaheuristics, vol 4771. Springer, Berlin, pp 170\u2013184"},{"doi-asserted-by":"crossref","unstructured":"Hoang AT, Le VT, Nguyen NG (2010) A novel particle swarm optimization-based algorithm for the optimal communication spanning tree problem. In: Proceedings of the 2010 2nd international conference on communication software and networks, pp 232\u2013236, Feb 2010","key":"49_CR8","DOI":"10.1109\/ICCSN.2010.111"},{"doi-asserted-by":"crossref","unstructured":"Kien PT, Hiep ND, Binh HTT (2011) New hybrid genetic algorithm for solving optimal communication spanning tree problem. In: The 26th symposium on applied computing, Taiwan, pp 1076\u20131081","key":"49_CR9","DOI":"10.1145\/1982185.1982421"},{"unstructured":"Rothlauf F (2006) Representations for genetic and evolutionary algorithms, 2 edn, Springer","key":"49_CR10"},{"issue":"2","key":"49_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/opre.1080.0592","volume":"57","author":"F Rothlauf","year":"2009","unstructured":"Rothlauf F (2009) On optimal solutions for the optimal communication spanning tree problem. Oper Res 57(2):4","journal-title":"Oper Res"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37502-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T18:42:04Z","timestamp":1674499324000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37502-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642375019","9783642375026"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37502-6_49","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"8 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}