{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T22:10:01Z","timestamp":1746310201929,"version":"3.40.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,20]],"date-time":"2014-07-20T00:00:00Z","timestamp":1405814400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10489-014-0559-4","type":"journal-article","created":{"date-parts":[[2014,7,19]],"date-time":"2014-07-19T06:03:06Z","timestamp":1405749786000},"page":"820-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On minimizing coding operations in network coding based multicast: an evolutionary algorithm"],"prefix":"10.1007","volume":"41","author":[{"given":"Huanlai","family":"Xing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuefeng","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,20]]},"reference":[{"key":"559_CR1","unstructured":"Miller CK (1998) Multicast networking and applications. Pearson Education"},{"key":"559_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10489-010-0256-x","volume":"36","author":"Y Xu","year":"2012","unstructured":"Xu Y, Qu R (2012) A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems. Appl Intell 36:229\u2013241","journal-title":"Appl Intell"},{"key":"559_CR3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10489-012-0357-9","volume":"38","author":"M Jahanshahi","year":"2013","unstructured":"Jahanshahi M, Dehghan M, Meybodi MR (2013) LAMR: learning automata based multicast routing protocol for multi-channel multi-radio wireless mesh networks. Appl Intell 38:58\u201377","journal-title":"Appl Intell"},{"issue":"4","key":"559_CR4","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li SYR, Yeung RW (2000) Network information flow. IEEE T Inform Theory 46(4):1204\u20131216","journal-title":"IEEE T Inform Theory"},{"issue":"2","key":"559_CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SYR Li","year":"2003","unstructured":"Li SYR, Yeung RW, Cai N (2003) Linear network coding. IEEE T Inform Theory 49(2):371\u2013381","journal-title":"IEEE T Inform Theory"},{"key":"559_CR6","unstructured":"Noguchi T, Matsuda T, Yamamoto M (2003) Performance evaluation of new multicast architecture with network coding. IEICE T Commun E86-B: 1788\u20131795"},{"issue":"11","key":"559_CR7","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/TCOMM.2005.857148","volume":"53","author":"Y Wu","year":"2005","unstructured":"Wu Y, Chou PA, Kung SY (2005) Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE T Commun 53(11):1906\u20131918","journal-title":"IEEE T Commun"},{"key":"559_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1111322.1111337","volume":"36","author":"C Fragouli","year":"2006","unstructured":"Fragouli C, Boudec JYL, Widmer J (2006) Network coding: an instant primer. Comput Commun Rev 36:63\u201368","journal-title":"Comput Commun Rev"},{"key":"559_CR9","volume-title":"On minimizing network coding resources: An evolutionary approach. In: Proceedings of Second Workshop on Network Coding, Theory, and Applications","author":"M Kim","year":"2006","unstructured":"Kim M, Ahn CW, M\u00e9dard M, Effros M (2006) On minimizing network coding resources: An evolutionary approach. In: Proceedings of Second Workshop on Network Coding, Theory, and Applications. NetCod2006, Boston"},{"key":"559_CR10","doi-asserted-by":"crossref","unstructured":"Kim M, M\u00e9dard M, Aggarwal V, Reilly VO, Kim W, Ahn CW, Effros M (2007) Evolutionary approaches to minimizing network coding resources. In: Proceedings of 26th IEEE International Conference on Computer Communications (INFOCOM2007). Anchorage, pp 1991\u20131999","DOI":"10.1109\/INFCOM.2007.231"},{"key":"559_CR11","unstructured":"Kim M, Aggarwal V, Reilly VO, M\u00e9dard M, Kim W (2007) Genetic representations for evolutionary optimization of network coding. In: Proceedings of EvoWorkshops 2007, LNCS 4448. Valencia, pp 21\u201331"},{"key":"559_CR12","doi-asserted-by":"crossref","unstructured":"Mitchell M (1996) An introduction to genetic algorithms. MIT Press","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"559_CR13","doi-asserted-by":"crossref","unstructured":"Krasnogor N, Smith JE (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE T Evolut Comput:474\u2013488","DOI":"10.1109\/TEVC.2005.850260"},{"key":"559_CR14","first-page":"58","volume":"12","author":"R Qu","year":"2009","unstructured":"Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY (2009) A survey of search methodologies and automated system development for examination timetabling. J Sched 12:58\u201389","journal-title":"J Sched"},{"issue":"12","key":"559_CR15","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/j.aeue.2009.11.012","volume":"64","author":"H Xing","year":"2010","unstructured":"Xing H, Ji Y, Bai L, Sun Y (2010) An improved quantum-inspired evolutionary algorithm for coding resource optimization based network coding multicast scheme. AEU-Int J Electron C 64 (12):1105\u20131113","journal-title":"AEU-Int J Electron C"},{"issue":"6","key":"559_CR16","doi-asserted-by":"crossref","first-page":"2386","DOI":"10.1109\/TIT.2006.874434","volume":"52","author":"M Langberg","year":"2006","unstructured":"Langberg M, Sprintson A, Bruck J (2006) The encoding complexity of network coding. IEEE T Inform Theory 52 (6):2386\u20132397","journal-title":"IEEE T Inform Theory"},{"issue":"5","key":"559_CR17","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R Koetter","year":"2003","unstructured":"Koetter R, M\u00e9dard M (2003) An algebraic approach to network coding. IEEE ACM T Network 11 (5):782\u2013795","journal-title":"IEEE ACM T Network"},{"key":"559_CR18","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/ISIT.2003.1228459","volume-title":"The benefits of coding over routing in a randomized setting. In: Proceedings of 2003 IEEE International Symposium on Information Theory","author":"T Ho","year":"2003","unstructured":"Ho T, Koetter R, M\u00e9dard M, Karger DR, Effros M (2003) The benefits of coding over routing in a randomized setting. In: Proceedings of 2003 IEEE International Symposium on Information Theory. Yokohama, Japan, pp 442-442"},{"key":"559_CR19","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S Jaggi","year":"2005","unstructured":"Jaggi S, Sanders P, Chou PA, Effros M, Egner S, Jain K, Tolhuizen L. (2005) Polynomial time algorithms for multicast network code construction. IEEE T Inform Theory 51:1973\u20131982","journal-title":"IEEE T Inform Theory"},{"key":"559_CR20","doi-asserted-by":"crossref","first-page":"2618","DOI":"10.1109\/TIT.2010.2046215","volume":"56","author":"SL Fong","year":"2010","unstructured":"Fong SL, Yeung RW (2010) Variable-rate linear network coding. IEEE T Inform Theory 56:2618\u20132625","journal-title":"IEEE T Inform Theory"},{"key":"559_CR21","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TIT.2005.864435","volume":"52","author":"C Fragouli","year":"2006","unstructured":"Fragouli C., Soljanin E. (2006) Information flow decomposition for network coding. IEEE T Inform Theory 52:829\u2013848","journal-title":"IEEE T Inform Theory"},{"key":"559_CR22","doi-asserted-by":"crossref","unstructured":"Xing H, Qu R, Kendall G, Bai R (2013) A path-oriented encoding evolutionary algorithm for network coding resource minimization. J Oper Res Soc: 1\u201317. doi: 10.1057\/jors.2013.79.","DOI":"10.1057\/jors.2013.79"},{"key":"559_CR23","doi-asserted-by":"crossref","unstructured":"Ji Y, Xing H (2011) A memory-storable quantum-inspired evolutionary algorithm for network coding resource minimization. In: Kita E (ed) Algorithm, Evolutionary. InTech, pp 363-380","DOI":"10.5772\/14863"},{"key":"559_CR24","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/LCOMM.2011.051911.110274","volume":"15","author":"H Xing","year":"2011","unstructured":"Xing H, Qu R (2011) A population based incremental learning for network coding resources minimization. IEEE Commun Lett 15:698\u2013700","journal-title":"IEEE Commun Lett"},{"key":"559_CR25","doi-asserted-by":"crossref","unstructured":"Xing H, Qu R (2011) A population based incremental learning for delay constrained network coding resource minimization. In: Proceedings of EvoApplications 2011. Torino, pp 51\u201360","DOI":"10.1007\/978-3-642-20520-0_6"},{"key":"559_CR26","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10489-011-0298-8","volume":"36","author":"H Xing","year":"2012","unstructured":"Xing H, Qu R (2012) A compact genetic algorithm for the network coding based resource minimization problem. Appl Intell 36:809\u2013823","journal-title":"Appl Intell"},{"issue":"12","key":"559_CR27","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1049\/el.2011.0805","volume":"47","author":"CW Ahn","year":"2011","unstructured":"Ahn CW (2011) Fast and adaptive evolutionary algorithm for minimum-cost multicast with network coding. Electron Lett 47(12):700\u2013701","journal-title":"Electron Lett"},{"key":"559_CR28","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.ins.2011.11.010","volume":"188","author":"HN Luong","year":"2012","unstructured":"Luong HN, Nguyen H TT, Ahn CW (2012) Entropy-based efficiency enhancement techniques for evolutionary algorithms. Inform Sci 188:100\u2013120","journal-title":"Inform Sci"},{"key":"559_CR29","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ins.2013.01.014","volume":"233","author":"H Xing","year":"2013","unstructured":"Xing H, Qu R (2013) A nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems. Iinform Sci 233:36\u201353","journal-title":"Iinform Sci"},{"key":"559_CR30","unstructured":"Goldberg A V (1985) A new max-flow algorithm. MIT Technical Report MIT\/LCS\/TM-291, Laboratory for Computer Science"},{"key":"559_CR31","unstructured":"Walpole R E, Myers R H, Myers S L, Ye K (2007) Probability and statistics for engineers and scientists. Pearson Education"},{"key":"559_CR32","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra E W (1959) A note on two problems in connection with graphs. Numer Math 1:267\u2013271","journal-title":"Numer Math"},{"key":"559_CR33","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10489-012-0368-6","volume":"38","author":"M Kaur","year":"2013","unstructured":"Kaur M, Kumar A (2013) Method for solving unbalanced fully fuzzy multi-objective solid minimal cost flow problems. Appl Intell 38:239\u2013254","journal-title":"Appl Intell"},{"key":"559_CR34","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10489-012-0411-7","volume":"39","author":"K Lwin","year":"2013","unstructured":"Lwin K, Qu R (2013) A hybrid algorithm for constrained portfolio selection problems. Appl Intell 39:251\u2013266","journal-title":"Appl Intell"},{"key":"559_CR35","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/s10489-012-0405-5","volume":"39","author":"YJ Zheng","year":"2013","unstructured":"Zheng Y J, Chen S Y (2013) Cooperative particle swarm optimization for multiobjective transportation planning. Appl Intell 39:202\u2013216","journal-title":"Appl Intell"},{"key":"559_CR36","doi-asserted-by":"crossref","unstructured":"Tsakonas A (2014) An analysis of accuracy-diversity trade-off for hybrid combined system with multiobjective predictor selection. Appl Intell. doi: 10.1007\/s10489-013-0507-8. . published online","DOI":"10.1007\/s10489-013-0507-8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0559-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0559-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0559-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T21:46:04Z","timestamp":1746308764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0559-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,20]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0559-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2014,7,20]]}}}