{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:27Z","timestamp":1725487047492},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_18","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T01:43:59Z","timestamp":1183427039000},"page":"173-182","source":"Crossref","is-referenced-by-count":1,"title":["A Memetic Algorithm Guided by Quicksortfor the Error-Correcting Graph Isomorphism Problem"],"prefix":"10.1007","author":[{"given":"Rodolfo","family":"Torres-Vel\u00e1zquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Estivill-Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"18_CR1","unstructured":"Greffenstette, J.: Incorporating problem specific knowledge into genetic algorithms. Davis, L., ed.: Genetic Algorithms and Simulated Annealing, Pitman (1987) 42\u201360"},{"key":"18_CR2","unstructured":"M\u00fchlenbein, H.: Parallel genetic algorithms, population genetics and combinatorial optimization. Schaffer, J., ed.: Proc. 3rd Int. Conf. Genetic Algorithms, George Mason Univ., Morgan Kaufmann (1989) 416\u2013421"},{"key":"18_CR3","unstructured":"Davis, L., ed.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H.: Evolution in time and space-the parallel genetic algorithm. Rawlins, G., ed.: Foundations of Genetic Algorithms, Indiana Univ., Morgan Kaufmann (1991) 316\u2013337","DOI":"10.1016\/B978-0-08-050684-5.50023-9"},{"key":"18_CR5","unstructured":"Merz, P., Freisleben, B.: A genetic local search approach to the quadratic assignment problem. B\u00e4ck, T., ed.: Proc. 7th Int. Conf. Genetic Algorithms, Michigan State Univ., East Lansing, Morgan Kaufmann (1997) 465\u2013472"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE T. Evolutionary Computation 4 (2000) 337\u2013352","journal-title":"IEEE T. Evolutionary Computation"},{"key":"18_CR7","unstructured":"Tsai, H.K., Yang, J.M., Kao, C.Y.: A genetic algorithm for traveling salesman problems. Spector, L., et al. eds.: GECCO-2001. Proc. Genetic and Evolutionary Conference, San Francisco, CA. Morgan Kaufmann (2001) 687\u2013693"},{"key":"18_CR8","first-page":"671","volume-title":"Congress on Evolutionary Computation CEC2001","author":"M. Rocha","year":"2001","unstructured":"Rocha, M., Mendes, R., Cortez, P., Neves, J.: Sitting guests at a wedding party: Experiments on genetic and evolutionary constrained optimization. Congress on Evolutionary Computation CEC2001, Seoul, Korea, IEEE Press (2001) 671\u2013678"},{"key":"18_CR9","first-page":"941","volume-title":"Congress on Evolutionary Computation CEC2001","author":"V. Estivill-Castro","year":"2001","unstructured":"Estivill-Castro, V., Torres-Vel\u00e1zquez, R.: Classical sorting embedded in genetic algorithms for improved permutation search. Congress on Evolutionary Computation CEC2001, Seoul, Korea, IEEE Press (2001) 941\u2013948"},{"key":"18_CR10","unstructured":"Estivill-Castro, V., Torres-Vel\u00e1zquez, R.: How should feasibility be handled by genetic algorithms on constraint combinatorial optimization problems? the case of the valued n-queens problem. 2nd Workshop on Memetic Algorithms. WOMA II. GECCO-2001. (2001) 146\u2013151"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1109\/3477.604100","volume":"27","author":"Y.K. Wang","year":"1997","unstructured":"Wang, Y.K., Fan, K.C., Horng, J.T.: Genetic-based search for error-correcting graph isomorphism. IEEE T. Systems, Man and Cybernetics, Part B: Cybernetics 27 (1997) 588\u2013597","journal-title":"IEEE T. Systems, Man and Cybernetics, Part B: Cybernetics"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"W.H. Tsai","year":"1979","unstructured":"Tsai, W.H., Fu, K.S.: Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE T. Systems, Man and Cybernetics 9 (1979) 757\u2013768","journal-title":"IEEE T. Systems, Man and Cybernetics"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Messmer, B., Bunke, H.: A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition (1999) 1979\u20131998","DOI":"10.1016\/S0031-3203(98)90142-X"},{"key":"18_CR14","unstructured":"Aarts, E., Lenstra, J.: Introduction. Aarts, E., Lenstra, J., eds.: Local Search in Combinatorial Optimization, Wiley (1997) 1\u201317"},{"key":"18_CR15","unstructured":"Knuth, D.: Sorting and Searching. Volume 3 of The Art of Computer Programming. Addison-Wesley (1973)"},{"key":"18_CR16","unstructured":"Sedgewick, R.: Algorithms in C++. Addison-Wesley (1992)"},{"key":"18_CR17","first-page":"26","volume":"4","author":"V. Estivill-Castro","year":"1993","unstructured":"Estivill-Castro, V., Wood, D.: Randomized adaptive sorting. Random Structures and Algorithms 4 (1993) 26\u201351","journal-title":"Randomized adaptive sorting. Random Structures and Algorithms"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"5","author":"G. Croes","year":"1958","unstructured":"Croes, G.: A method for solving traveling-salesman problems. Operations Research 5 (1958) 791\u2013812","journal-title":"Operations Research"},{"key":"18_CR19","unstructured":"Goldberg, D., Lingle, R.J.: Alleles, loci, and the traveling salesman problem. Grefenstette, J., ed.: Proc. Int. Conf. Genetic Algorithms and their Applications, Carnegie Mellon Univ., Lawrence Erlbaum (1985) 154\u2013159"},{"key":"18_CR20","unstructured":"Baker, J.: Adaptive selection methods for genetic algorithms. Grefenstette, J., ed.: Proc. Int. Conf. on Genetic Algorithms and their Applications, Carnegie Mellon Univ., Lawrence Erlbaum (1985)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., MacReady, W.: No free lunch theorems for optimization. IEEE T. on Evolutionary Computation 1 (1997) 67\u201382","journal-title":"IEEE T. on Evolutionary Computation"},{"key":"18_CR22","volume-title":"Combinatorial Algorithms, Theory and Practice","author":"E. Reingold","year":"1977","unstructured":"Reingold, E., Nievergelt, J., Deo, N.: Combinatorial Algorithms, Theory and Practice. Prentice-Hall, Englewood Cliffs, NJ (1977)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Li, M., Vitanyi, P.: A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution. Proc. 30th IEEE Symp. on Foundations of Computer Science, Research Triangle Park, NC. (1989) 34\u201339","DOI":"10.1109\/SFCS.1989.63452"}],"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-46004-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T16:34:49Z","timestamp":1550421289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}