%0 Conference Paper %1 conf/sac/KienHB11 %A Kien, Pham Trung %A Hiep, Nguyen Duy %A Binh, Huynh Thi Thanh %B SAC %D 2011 %E Chu, William C. %E Wong, W. Eric %E Palakal, Mathew J. %E Hung, Chih-Cheng %I ACM %K dblp %P 1076-1081 %T New hybrid genetic algorithm for solving optimal communication spanning tree problem. %U http://dblp.uni-trier.de/db/conf/sac/sac2011.html#KienHB11 %@ 978-1-4503-0113-8

@inproceedings{conf/sac/KienHB11, added-at = {2018-11-06T00:00:00.000+0100}, author = {Kien, Pham Trung and Hiep, Nguyen Duy and Binh, Huynh Thi Thanh}, biburl = {https://www.bibsonomy.org/bibtex/28bf7c6e25bb2fe11b6682f2098132af0/dblp}, booktitle = {SAC}, crossref = {conf/sac/2011}, editor = {Chu, William C. and Wong, W. Eric and Palakal, Mathew J. and Hung, Chih-Cheng}, ee = {https://doi.org/10.1145/1982185.1982421}, interhash = {3d01916f4b5a0d18f87ee663dd0db59b}, intrahash = {8bf7c6e25bb2fe11b6682f2098132af0}, isbn = {978-1-4503-0113-8}, keywords = {dblp}, pages = {1076-1081}, publisher = {ACM}, timestamp = {2018-11-07T13:12:22.000+0100}, title = {New hybrid genetic algorithm for solving optimal communication spanning tree problem.}, url = {http://dblp.uni-trier.de/db/conf/sac/sac2011.html#KienHB11}, year = 2011 }