{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T04:43:21Z","timestamp":1745124201725},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540419204"},{"type":"electronic","value":"9783540453659"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45365-2_1","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T22:42:21Z","timestamp":1191710541000},"page":"1-10","source":"Crossref","is-referenced-by-count":6,"title":["The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Gaube","sequence":"first","affiliation":[]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,6]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"T.C. Hu. Optimum communication spanning trees. SIAM Journal on Computing, 3(3):188\u2013195, September 1974.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman, New York, 1979."},{"key":"1_CR3","unstructured":"L. Davis, D. Orvosh, A. Cox, and Y. Qiu. A genetic algorithm for survivable network design. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 408\u2013415, San Mateo, CA, 1993. Morgan Kaufmann."},{"key":"1_CR4","unstructured":"L.T.M. Berry, B.A. Murtagh, and S.J. Sugden. A genetic-based approach to tree network synthesis with cost constraints. In HansJ\u00fcrgen Zimmermann, editor, Second European Congress on Intelligent Techniques and Soft Computing-EUFIT\u201994, volume 2, pages 626\u2013629, Promenade 9, D-52076 Aachen, 1994. Verlag der Augustinus Buchhandlung."},{"key":"1_CR5","unstructured":"J.R. Kim and M. Gen. Genetic algorithm for solving bicriteria network topology design problem. In Peter J. Angeline, Zbyszek Michalewicz, Marc Schoenauer, Xin Yao, Ali Zalzala, and William Porto, editors, Proceedings of the 1999 IEEE Congress on Evolutionary Computation, pages 2272\u20132279. IEEE Press, 1999."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Y. Li and Y. Bouchebaba. A new genetic algorithm for the optimal communication spanning tree problem. In C. Fonlupt, J.-K. Hao, E. Lutton, E. Ronald, and M. Schoenauer, editors, Proceedings of Artificial Evolution: Fifth European Conference, page xx, Berlin, 1999. Springer.","DOI":"10.1007\/10721187_12"},{"key":"1_CR7","unstructured":"K.S. Tang, K.F. Man, and K.T. Ko. Wireless LAN desing using hierarchical genetic algorithm. In T. B\u00e4ck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 629\u2013635, San Francisco, 1997. Morgan Kaufmann."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"M.C. Sinclair. Minimum cost topology optimisation of the COST 239 European optical network. In D.W. Pearson, N.C. Steele, and R.F. Albrecht, editors, Proceedings of the 1995 International Conference on Artificial Neural Nets and Genetic Algorithms, pages 26\u201329, New York, 1995. Springer-Verlag.","DOI":"10.1007\/978-3-7091-7535-4_9"},{"key":"1_CR9","volume-title":"Comparison of algorithms for the degree constrained minimum spanning tree","author":"M. Krishnamoorthy","year":"1999","unstructured":"M. Krishnamoorthy, A.T. Ernst, and Y.M. Sharaiha. Comparison of algorithms for the degree constrained minimum spanning tree. Tech. rep., CSIRO Mathematical and Information Sciences, Clayton, Australia, 1999."},{"key":"1_CR10","volume-title":"Network random keys-a tree network representation scheme for genetic and evolutionary algorithms","author":"F. Rothlauf","year":"2000","unstructured":"F. Rothlauf, D.E. Goldberg, and A. Heinzl. Network random keys-a tree network representation scheme for genetic and evolutionary algorithms. Technical Report No. 8\/2000, University of Bayreuth, Germany, 2000."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"G.R. Raidl and B.A. Julstrom. A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem. In Janice Carroll, Ernesto Damiani, Hisham Haddad, and Dave Oppenheim, editors, Proceedings of the 2000 ACM Symposium on Applied Computing, pages 440\u2013445. ACM Press, 2000.","DOI":"10.1145\/335603.335888"},{"key":"1_CR12","first-page":"742","volume":"27","author":"H. Pr\u00fcfer","year":"1918","unstructured":"H. Pr\u00fcfer. Neuer Beweis eines Satzes ueber Permutationen. Arch. Math. Phys., 27:742\u2013744, 1918.","journal-title":"Arch. Math. Phys."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"F. Rothlauf and D.E. Goldberg. Pruefernumbers and genetic algorithms: A lesson on how the low locality of an encoding can harm the performance of Gas. In Kalyanmoy Deb, G\u00fcnther Rodolph, Xin Yao, and Hans-Paul Schwefel, editors, Proceedings of the 2000 Parallel Problem Solving from Nature VI Conference, pages 395\u2013404. Springer, 2000.","DOI":"10.1007\/3-540-45356-3_39"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"J.C. Bean. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154\u2013160, 1994.","journal-title":"ORSA Journal on Computing"},{"key":"1_CR15","unstructured":"C.C. Palmer. An approach to a problem in network design using genetic algorithms. unpublished PhD thesis, Polytechnic University, Troy, NY, 1994."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"F.N. Abuali, R.L. Wainwright, and D.A. Schoenefeld. Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem. In L. Eschelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 470\u2013477, San Francisco, CA, 1995. Morgan Kaufmann.","DOI":"10.1145\/315891.316001"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G. Harik","year":"1999","unstructured":"G. Harik, E. Cant\u00fa-Paz, D.E. Goldberg, and Brad L. Miller. The gambler\u2019s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231\u2013253, 1999.","journal-title":"Evolutionary Computation"},{"key":"1_CR18","first-page":"379","volume":"1","author":"C.C. Palmer","year":"1994","unstructured":"C.C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, volume 1, pages 379\u2013384, Piscataway, NJ, 1994. IEEE Service Center.","journal-title":"Proceedings of the First IEEE Conference on Evolutionary Computation"},{"key":"1_CR19","volume-title":"Telecommunications network design algorithms","author":"A. Kershenbaum","year":"1993","unstructured":"A. Kershenbaum. Telecommunications network design algorithms. McGraw Hill, New York, 1993."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389\u20131401, 1957.","journal-title":"Bell System Technical Journal"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"S. Ronald. Robust encodings in genetic algorithms: A survey of encoding issues. In Proceedings of the Forth International Conference on Evolutionary Computation, pages 43\u201348, Piscataway, NJ, 1997. IEEE.","DOI":"10.1109\/ICEC.1997.592265"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45365-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:43:23Z","timestamp":1556883803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45365-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540419204","9783540453659"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45365-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}