{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:20Z","timestamp":1725551060151},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253372"},{"type":"electronic","value":"9783540319962"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31996-2_21","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T21:17:28Z","timestamp":1270070248000},"page":"224-233","source":"Crossref","is-referenced-by-count":2,"title":["An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem"],"prefix":"10.1007","author":[{"given":"Maolin","family":"Tang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Tang, M., Eshraghian, K., Cheung, H.N.: An Efficient Approach to Constrained Via Minimization for Two-Layer VLSI Routing. In: Proc. IEEE Asia and South Pacific Design Automation Conference, Hong Kong, pp. 149\u2013152 (1999)","DOI":"10.1109\/ASPDAC.1999.759982"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1604","DOI":"10.1109\/12.42135","volume":"38","author":"N.J. Naclerio","year":"1989","unstructured":"Naclerio, N.J., Masuda, S., Nakajima, K.: The Via Minimization problem is NP-complete. IEEE Transactions on Computers\u00a038, 1604\u20131608 (1989)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Tang, M., Eshraghian, K., Cheung, H.N.: A Genetic Algorithm for Constrained Via Minimization. In: Proc. IEEE International Conference on Neural Information Processing, Perth, pp. 435\u2013440 (1999)","DOI":"10.1109\/ICONIP.1999.845634"},{"key":"21_CR4","unstructured":"Harik, G.R., Goldberg, D.E.: Linkage Learning. IlliGAL Technical Report 96006 (1996)"},{"key":"21_CR5","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"21_CR6","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems\u00a03, 493\u2013530 (1989)","journal-title":"Complex Systems"},{"key":"21_CR7","unstructured":"Harik, G.R.: Lingake Learning Via Probabilistic Modeling. IlliGAL Technical Report 99010 (1999)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"H. M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In: Eiben, A., B\u00e4ck, T., Shoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN IV, pp. 178\u2013187. Springer, Berlin (1996)"},{"key":"21_CR9","first-page":"523","volume-title":"International Conference on Evolutionary Computation","author":"G.R. Harik","year":"1998","unstructured":"Harik, G.R., Lobo, F.G., Goldberg, D.E.: The Compact Genetic Algorithm. In: International Conference on Evolutionary Computation, pp. 523\u2013528. IEEE, New Jersey (1998)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Goldberg, D.E., Cantu-Paz, K.: Linkage Problem, Distribution Estimation, and Bayesian Networks. Evolutionary Computation\u00a08, 311\u2013340","DOI":"10.1162\/106365600750078808"},{"key":"21_CR11","unstructured":"Sastry, K.: Analysis of Mixing in Genetic Algorithms: A survey. IlliGAL Report No. 2002012 (2002)"},{"key":"21_CR12","unstructured":"Sastry, K., Goldberg, D.E.: How Well Does A Single-Point Crossover Mix Building Blocks with Tight Linkage? IlliGAL Report No. 2002013 (2002)"},{"key":"21_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/4235.942531","volume":"5","author":"A. Pr\u00fcgel-Bennett","year":"2001","unstructured":"Pr\u00fcgel-Bennett, A.: Modeling Cross-Induced Linkage in Genetic Algorithms. IEEE Trans. on Evolutionary Computation\u00a05, 376\u2013387 (2001)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"21_CR15","unstructured":"Thierens, D., Goldberg, D.E.: Mixing in Genetic Algorithms. In: Proc. the 5th Int. Conf. on Genetic Algorithms, pp. 38\u201345 (1993)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31996-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:33:33Z","timestamp":1605760413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31996-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253372","9783540319962"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31996-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}