{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:28:09Z","timestamp":1725492489035},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422334"},{"type":"electronic","value":"9783540457183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45718-6_74","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:47:30Z","timestamp":1191736050000},"page":"689-698","source":"Crossref","is-referenced-by-count":3,"title":["Applying Evolutionary Algorithms to Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Enrique Alba","family":"Torres","sequence":"first","affiliation":[]},{"given":"Sami","family":"Khuri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"issue":"number 4","key":"74_CR1","first-page":"31","volume":"4","author":"A. E","year":"1999","unstructured":"E. Alba and J. M. Troya. A survey of parallel distributed genetic algorithms Complexity pages 31\u201352, vol. 4,number 4, 1999.","journal-title":"A survey of parallel distributed genetic algorithms Complexity"},{"issue":"number 2","key":"74_CR2","first-page":"805","volume":"9","author":"C. H","year":"1998","unstructured":"H. Chen, N. S. Flann, and D. W. Watson. Parallel genetic simulated annealing: a massively parallel SIMD algorithm. IEEE transactions on parallel and distributed systems, pages 805\u2013811, vol. 9,number 2, February 1998.","journal-title":"IEEE transactions on parallel and distributed systems"},{"key":"74_CR3","doi-asserted-by":"crossref","unstructured":"K. Dontas and K. De Jong. Discovery of maximal distance codes using genetic algorithms. Proceedings of the Tools for Artificial Intelligence Conference, pages 805\u2013811, Reston, VA, 1990.","DOI":"10.1109\/TAI.1990.130442"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"P. Brucker, Scheduling Algorithms, Springer-Verlag, 2nd edition, 1998.","DOI":"10.1007\/978-3-662-03612-9"},{"key":"74_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"Karp. R. M","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computation, pages 85\u2013103. Plenum, New York, 1972."},{"key":"74_CR6","first-page":"66","volume-title":"Proceedings of the 22nd Annual ACM Computer Science Conference","author":"K. S","year":"1994","unstructured":"S. Khuri, T. B\u00e4ck, and J. Heitk\u00f6tter. An evolutionary approach to combinatorial optimization problems. Proceedings of the 22nd Annual ACM Computer Science Conference, pages 66\u201373, ACM Press, NY, 1994."},{"key":"74_CR7","unstructured":"S. Lin and D. J. Costello, Jr. Error Control Coding: Fundamentals and Applications\u2019, Prentice Hall, 1989."},{"key":"74_CR8","unstructured":"B. Manderick and P. Spiessens. Fine-grained parallel genetic algorithms, Proceedings of the 3rd ICGA, pages 428\u2013433, Morgan Kaufmann, 1989."},{"key":"74_CR9","unstructured":"C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994."},{"key":"74_CR10","first-page":"236","volume-title":"Lecture Notes in Computer Science","author":"S. J","year":"1996","unstructured":"J. Sarma and K. De Jong. An analysis of the effect of the neighborhood size and shape on local selection algorithms. Lecture Notes in Computer Science, vol. 1141, pages 236\u2013244, Springer-Verlag, Heidelberg, 1996."},{"key":"74_CR11","unstructured":"W. Spears. Workshop on test problems generators. Proceedings of the International Conference on Genetic Algorithms, Michigan, July 1997."},{"key":"74_CR12","volume-title":"An Introduction to the Design and Analysis of Algorithms","author":"Stinson. D. R","year":"1987","unstructured":"D. R. Stinson. An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada, 2nd edition, 1987.","edition":"2nd edition"},{"key":"74_CR13","doi-asserted-by":"crossref","unstructured":"G. Syswerda, A Study of Reproduction in Generational and Steady-State Genetic Algorithms. Proceedings of FOGA, pages 94\u2013101, Morgan Kaufmann, 1991.","DOI":"10.1016\/B978-0-08-050684-5.50009-4"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45718-6_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T23:33:47Z","timestamp":1548372827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45718-6_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422334","9783540457183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45718-6_74","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}