{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:23:35Z","timestamp":1725575015931},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233183"},{"type":"electronic","value":"9783540301325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30132-5_128","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T02:15:59Z","timestamp":1294971359000},"page":"952-958","source":"Crossref","is-referenced-by-count":7,"title":["A New Encoding for the Degree Constrained Minimum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Sang-Moon","family":"Soak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Corne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ha","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"128_CR1","doi-asserted-by":"crossref","unstructured":"Abuali, F.N., Wainwright, R.L., Schoenefeld, D.A.: Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem. In: Eshelman, L.J. (ed.) Proc. 6th ICGA, pp. 470\u2013477 (1995)","DOI":"10.1145\/315891.316001"},{"issue":"2","key":"128_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Computing\u00a06(2), 154\u2013160 (1994)","journal-title":"ORSA J. Computing"},{"key":"128_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0167-8191(95)00010-0","volume":"22","author":"B. Boldon","year":"1996","unstructured":"Boldon, B., Deo, N., Kumar, N.: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Parallel Computing\u00a022, 369\u2013382 (1996)","journal-title":"Parallel Computing"},{"key":"128_CR4","doi-asserted-by":"crossref","unstructured":"Dengiz, B., Altiparmak, F., Smith, A.E.: Local Search Genetic Algorithm for Optimal Design of Reliable Networks. IEEE Trans. on Evolutionary Computation\u00a01(3) (1997)","DOI":"10.1109\/4235.661548"},{"key":"128_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45365-2_1","volume-title":"Applications of Evolutionary Computing","author":"T. Gaube","year":"2001","unstructured":"Gaube, T., Rothlauf, F.: The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 1\u201310. Springer, Heidelberg (2001)"},{"key":"128_CR6","volume-title":"Genetic Algorithms and Engineering Design","author":"M. Gen","year":"1997","unstructured":"Gen, M., Cheng, R.: Genetic Algorithms and Engineering Design. Wiley, Chichester (1997)"},{"key":"128_CR7","unstructured":"Gottlieb, J., Julstrom, G.A., Raidl, G.R., Rothlauf, F.: Prufer number: A Poor Representation of Spanning Trees for Evolutionary Search, IlliGAL Report No.\u00a02001001, Illinois Genetic Algorithms Lab. Univ. of Illinois (2001)"},{"key":"128_CR8","volume-title":"Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges","author":"B.A. Julstrom","year":"2002","unstructured":"Julstrom, B.A., Raidl, G.R.: Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges. ACM SAC, New York (2002)"},{"issue":"2","key":"128_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J.D. Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: 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":"128_CR10","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.: Comparision of Algorithms for the Degree Constrained Minimum Spanning Tree. Journal of Heuristics\u00a07, 587\u2013611 (2001)","journal-title":"Journal of Heuristics"},{"key":"128_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45365-2_2","volume-title":"Applications of Evolutionary Computing","author":"Y. Li","year":"2001","unstructured":"Li, Y.: An Effective Implementation of a Direct Spanning Tree Representation in GAs. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 11\u201319. Springer, Heidelberg (2001)"},{"key":"128_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Z. Michalewicz","year":"1992","unstructured":"Michalewicz, Z.: Genetic Algorithms+Data Structures=Evolution Programs. Springer, Heidelberg (1992)"},{"key":"128_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"S.C. Narula","year":"1980","unstructured":"Narula, S.C., Ho, C.A.: Degree-constrained minimum spanning tree. Computer and Operations Research\u00a07, 239\u2013249 (1980)","journal-title":"Computer and Operations Research"},{"key":"128_CR14","doi-asserted-by":"crossref","unstructured":"Palmer, C., Kershenbaum, A.: Representing Trees in Genetic Algorithms. Proc. IEEE ICEC, 379\u2013384 (1994)","DOI":"10.1109\/ICEC.1994.349921"},{"key":"128_CR15","doi-asserted-by":"crossref","unstructured":"Palmer, C., Kershenbaum, A.: An Approach to a Problem in Network Design Using GAs. Networks\u00a026 (1995)","DOI":"10.1002\/net.3230260305"},{"key":"128_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/3-540-60154-6_63","volume-title":"Progress in Evolutionary Computation","author":"P. Piggott","year":"1995","unstructured":"Piggott, P., Suraweera, F.: Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem. In: Yao, X. (ed.) AI-WS 1993 and 1994. LNCS, vol.\u00a0956, pp. 305\u2013314. Springer, Heidelberg (1995)"},{"key":"128_CR17","unstructured":"Raidl, G.R., Julstrom, B.A.: Edge-Sets: An Effective Evolutionary Coding of Spanning Trees, TR-186-1-01-01, Vienna University of Technology (2002)"},{"key":"128_CR18","unstructured":"Raidl, G.R., Drexel, C.: A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem, Late-Breaking-Papera. In: Proc. GECCO 2000, pp. 309\u2013316 (2000)"},{"key":"128_CR19","unstructured":"Rothlauf, F., Goldberg, D.E., Heinzl, A.: Network Random Keys - A Tree Network Representation Scheme for Genetic and Evolutionary Algorithms, IlliGAL Report No.\u00a02000031 (2000)"},{"key":"128_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-46004-7_15","volume-title":"Applications of Evolutionary Computing","author":"B. Schindler","year":"2002","unstructured":"Schindler, B., Rothlauf, F., Pesch, H.J.: Evolution Strategies, Network Random Keys, and the One-Max Tree Problem. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol.\u00a02279, pp. 143\u2013152. Springer, Heidelberg (2002)"},{"key":"128_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.1007\/3-540-45110-2_49","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"S.-M. Soak","year":"2003","unstructured":"Soak, S.-M., Ahn, B.-H.: New Subtour-Based Crossover Operator for the TSP, GECCO 2003. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1610\u20131611. Springer, Heidelberg (2003)"},{"key":"128_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F","volume":"30","author":"G. Zhou","year":"1997","unstructured":"Zhou, G., Gen, M.: A Note on GAs for Degree-Constrained Spanning Tree Problems. Networks\u00a030, 91\u201395 (1997)","journal-title":"Networks"},{"issue":"3","key":"128_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0305-0548(97)00039-7","volume":"25","author":"G. Zhou","year":"1998","unstructured":"Zhou, G., Gen, M.: An Effective Genetic Algorithm Approach to The Quadratic Minimum Spanning Tree Problem. Computers Operations Researches\u00a025(3), 229\u2013237 (1998)","journal-title":"Computers Operations Researches"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30132-5_128.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:43:06Z","timestamp":1605760986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30132-5_128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233183","9783540301325"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30132-5_128","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}