{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:34:59Z","timestamp":1725521699598},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540891963"},{"type":"electronic","value":"9783540891970"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89197-0_110","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T07:23:50Z","timestamp":1228289030000},"page":"1077-1085","source":"Crossref","is-referenced-by-count":9,"title":["New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Huynh Thi Thanh","family":"Binh","sequence":"first","affiliation":[]},{"given":"Truong Binh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"110_CR1","unstructured":"Goldbarg, E.F.G., de Souza, G.R., Goldbarg, C.: Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree. IEEE Congress on Evolutionary Computation, 1527\u20131534 (2006)"},{"issue":"2","key":"110_CR2","first-page":"157","volume":"3","author":"G. Zhou","year":"1997","unstructured":"Zhou, G., Gen, M.: Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Engineering Design & Automation\u00a03(2), 157\u2013165 (1997)","journal-title":"Engineering Design & Automation"},{"key":"110_CR3","unstructured":"Gottlieb, J., Julstrom, B.A., Raidl, G.R., Rothlauf, F.: Pr\u00fcfer numbers: A poor representation of spanning trees for evolutionary search (2000)"},{"issue":"2","key":"110_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J. Knowles","year":"2000","unstructured":"Knowles, J., Corne, D.: A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem. IEEE Trans. on Evolutionary Computation\u00a04(2), 125\u2013134 (2000)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"110_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M. Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy, M., Ernst, A.T., Sharaiha, Y.M.: Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. Journal of Heuristics\u00a07, 587\u2013611 (2001)","journal-title":"Journal of Heuristics"},{"key":"110_CR6","unstructured":"Hanr, L., Wang, Y.: A Novel Genetic Algorithm for Degree-Constrained Minimum Spanning Tree Problem. IJCSNS International Journal of Computer Science and Network Security\u00a06(7A) (2006)"},{"key":"110_CR7","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy, M., Craig, G., Palaniswarmi, M.: Comparison of heuristic algorithms for the degree constrained minimum spanning tree. In: Osman, I.H., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, pp. 83\u201396 (1996)","DOI":"10.1007\/978-1-4613-1361-8_6"},{"key":"110_CR8","volume-title":"Metaheuristic : Advances and trends in local Search Procedures for Optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenov\u00edc, N.: An Introduction to variable neighborhood search. In: Vos, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Metaheuristic: Advances and trends in local Search Procedures for Optimization. Kluwer, Dordrecht (1999)"},{"key":"110_CR9","doi-asserted-by":"crossref","unstructured":"Bui, T.N., Zrncic, C.M.: An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree. In: GECCO 2006 (2006)","DOI":"10.1145\/1143997.1144000"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2008: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89197-0_110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:18:35Z","timestamp":1557947915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89197-0_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540891963","9783540891970"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89197-0_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}