{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:50Z","timestamp":1750307270119,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.01.14.09"],"award-info":[{"award-number":["102.01.14.09"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982421","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"1076-1081","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["New hybrid genetic algorithm for solving optimal communication spanning tree problem"],"prefix":"10.1145","author":[{"given":"Pham Trung","family":"Kien","sequence":"first","affiliation":[{"name":"Hanoi University of Technology, Ha Noi, Viet Nam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Duy","family":"Hiep","sequence":"additional","affiliation":[{"name":"Hanoi University of Technology, Ha Noi, Viet Nam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[{"name":"Hanoi University of Technology, Ha Noi, Viet Nam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSN.2010.111"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.21.3.163"},{"key":"e_1_3_2_1_3_1","first-page":"361","volume-title":"Regional Teletraffic Engrg. Conf. Internat. Teletraffic Congress, Telkom South Africa","author":"Berry L. T. M.","year":"1995"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080402"},{"key":"e_1_3_2_1_6_1","first-page":"2272","volume-title":"1999 IEEE Congress on Evolutionary Computation, IEEE Press","author":"Kim J. R.","year":"1999"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1994.349921"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/335603.335888"},{"key":"e_1_3_2_1_9_1","unstructured":"Reshef E. \"Approximating minimum communication cost spanning trees and related problems\" Master's thesis Feinberg Graduate School of the Weizmann Institute of Science Rehovot 76100 Israel (1999).  Reshef E. \"Approximating minimum communication cost spanning trees and related problems\" Master's thesis Feinberg Graduate School of the Weizmann Institute of Science Rehovot 76100 Israel (1999)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301781"},{"edition":"2","volume-title":"Rothlauf, F., \"Representations for Genetic and Evolutionary Algorithms\"","year":"2006","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0592"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31996-2_19"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2882"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569951"},{"key":"e_1_3_2_1_16_1","unstructured":"Thomas Fischer Peter Merz. \"\n      A\n      \n       Memetic Algorithm for the Optimum Communication Spanning Tree Problem\".\n  \n   \n  4th International Workshop on Hybrid Metaheuristics Dortmund Germany October 8--9 2007 volume \n  4771\n   of \n  LNCS pp. \n  170\n  --\n  184\n  .   Thomas Fischer Peter Merz. \"A Memetic Algorithm for the Optimum Communication Spanning Tree Problem\". 4th International Workshop on Hybrid Metaheuristics Dortmund Germany October 8--9 2007 volume 4771 of LNCS pp. 170--184."}],"event":{"name":"SAC'11: The 2011 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"TaiChung Taiwan","acronym":"SAC'11"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:55Z","timestamp":1750243975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":16,"alternative-id":["10.1145\/1982185.1982421","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982421","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}