{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:34:56Z","timestamp":1761597296271},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/tevc.2011.2125971","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T19:43:08Z","timestamp":1309290188000},"page":"266-278","source":"Crossref","is-referenced-by-count":23,"title":["An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem"],"prefix":"10.1109","volume":"16","author":[{"given":"Thang N.","family":"Bui","sequence":"first","affiliation":[]},{"given":"Xianghua","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Catherine M.","family":"Zrncic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","author":"hogg","year":"2009","journal-title":"Probability and Statistical Inference"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/335603.335888"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"ref13","first-page":"104","article-title":"An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem","volume":"1","author":"raidl","year":"2000","journal-title":"Proc IEEE CEC"},{"key":"ref14","first-page":"430","article-title":"A powerful new encoding for tree-based combinatorial optimization problems","volume":"lncs 3242","author":"soak","year":"2004","journal-title":"Proc PPSN"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569903"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90169-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(85)90032-2"},{"key":"ref27","first-page":"678","article-title":"Node-depth encoding for evolutionary algorithms applied to network design","volume":"lncs 3102","author":"delbem","year":"2004","journal-title":"Proc Conf Genet Evol Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"ref6","first-page":"438","article-title":"Many birds with one stone: Multiobjective approximation algorithms","author":"ravi","year":"1993","journal-title":"Proc 25th Annu ACM Symp Theory Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871250"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4235.850653"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011977126230"},{"key":"ref7","author":"craig","year":"1996","journal-title":"Metaheuristics Theory and Applications"},{"key":"ref2","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00010-0"},{"key":"ref1","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11596448_97"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424510"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144000"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5585939"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89197-0_110"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/12.508322","article-title":"Genetic algorithm and graph partitioning","volume":"45","author":"bui","year":"1996","journal-title":"IEEE Trans Comput"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/6176231\/05910378.pdf?arnumber=5910378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:48:00Z","timestamp":1633909680000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5910378\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2011.2125971","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}