{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:10:13Z","timestamp":1780355413687,"version":"3.54.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030167103","type":"print"},{"value":"9783030167110","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16711-0_9","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"131-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Quasi-Optimal Recombination Operator"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4027-8851","authenticated-orcid":false,"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,3,28]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"NJ Radcliffe","year":"1994","unstructured":"Radcliffe, N.J.: The algebra of genetic algorithms. Ann. Math. Artif. Intell. 10(4), 339\u2013384 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR2","unstructured":"Eremeev, A.V., Kovalenko, J.V.: Optimal recombination in genetic algorithms. CoRR abs\/1307.5519 (2013). http:\/\/arxiv.org\/abs\/1307.5519"},{"key":"9_CR3","first-page":"359","volume":"14","author":"PL Hammer","year":"1963","unstructured":"Hammer, P.L., Rosenberg, I., Rudeanu, S.: On the determination of the minima of pseudo-boolean functions. Stud. Cerc. Mat. 14, 359\u2013364 (1963)","journal-title":"Stud. Cerc. Mat."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1\u201316. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30577-4_1"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Whitley, D., Chicano, F., Goldman, B.W.: Gray box optimization for mk landscapes (nk landscapes and max-ksat). Evol. Comput. 24, 491\u2013519 (2016)","DOI":"10.1162\/EVCO_a_00184"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Chicano, F.: Partition crossover for pseudo-boolean optimization. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII FOGA 2015, pp. 137\u2013149. ACM, New York (2015)","DOI":"10.1145\/2725494.2725497"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chicano, F., Ochoa, G., Whitley, D., Tin\u00f3s, R.: Enhancing partition crossover with articulation points analysis. In: Proceedings of GECCO. GECCO 2018, pp. 269\u2013276. ACM, New York (2018)","DOI":"10.1145\/3205455.3205561"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Ochoa, G., Tin\u00f3s, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference GECCO 2017, pp. 753\u2013760 (2017)","DOI":"10.1145\/3071178.3071285"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Chen, W., Whitley, D., Tin\u00f3s, R., Chicano, F.: Tunneling between plateaus: improving on a state-of-the-art maxsat solver using partition crossover. In: Proceedings of GECCO. GECCO 2018, pp. 921\u2013928. ACM, New York (2018)","DOI":"10.1145\/3205455.3205482"},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TEVC.2018.2828643","volume":"22","author":"R Tin\u00f3s","year":"2018","unstructured":"Tin\u00f3s, R., Zhao, L., Chicano, F., Whitley, D.: Nk hybrid genetic algorithm for clustering. IEEE Trans. Evol. Comput. 22(5), 748\u2013761 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Terras, A.: Fourier Analysis on Finite Groups and Applications. Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9780511626265"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-60618-1_88","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Galinier","year":"1995","unstructured":"Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 358\u2013371. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60618-1_88"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1098\/rspb.1998.0438","volume":"256","author":"MEJ Newman","year":"1998","unstructured":"Newman, M.E.J., Engelhardt, R.: Effect of neutral selection on the evolution of molecular species. Proc. R. Soc. London B 256, 1333\u20131338 (1998)","journal-title":"Proc. R. Soc. London B"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16711-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:35:09Z","timestamp":1709814909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16711-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030167103","9783030167110"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16711-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}