{"id":"https://openalex.org/W2011559870","doi":"https://doi.org/10.1145/2001576.2001711","title":"How crossover helps in pseudo-boolean optimization","display_name":"How crossover helps in pseudo-boolean optimization","publication_year":2011,"publication_date":"2011-07-12","ids":{"openalex":"https://openalex.org/W2011559870","doi":"https://doi.org/10.1145/2001576.2001711","mag":"2011559870"},"language":"en","primary_location":{"id":"doi:10.1145/2001576.2001711","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2001576.2001711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004366897","display_name":"Timo K\u00f6tzing","orcid":"https://orcid.org/0000-0002-1028-5228"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Timo K\u00f6tzing","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["University of Birmingham, Edgbaston, Birmingham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Birmingham, Edgbaston, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076897873","display_name":"Madeleine Theile","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Madeleine Theile","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004366897"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":11.8415,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.98515928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"989","last_page":"996"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9712361097335815},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.597919762134552},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5689690113067627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5202133059501648},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4942200481891632},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4442768096923828},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35322117805480957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3029228746891022},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20798519253730774},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11203840374946594}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9712361097335815},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.597919762134552},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5689690113067627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5202133059501648},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4942200481891632},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4442768096923828},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35322117805480957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3029228746891022},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20798519253730774},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11203840374946594},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2001576.2001711","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2001576.2001711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:edoc.mpg.de:618706","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618706","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krasnogor, Natalio; Lanzi, Pier Luca: GECCO 2011 : Genetic and Evolutionary Computation Conference, ACM, 989-996 (2011)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/64ea93cd-6c85-49d3-bdc0-ea3a0a4a82ca","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/64ea93cd-6c85-49d3-bdc0-ea3a0a4a82ca","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"K\u00f6tzing, T, Sudholt, D & Theile, M 2011, How Crossover Helps in Pseudo-Boolean Optimization. in GECCO '11 Proceedings of the 13th annual conference on Genetic and evolutionary computation. Association for Computing Machinery , pp. 989-996, Annual Conference on Genetic and Evolutionary Computation (GECCO '11), 13th, New York, United States, 16/07/11. https://doi.org/10.1145/2001576.2001711","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.mpg.de:item_1562390","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0010-1234-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GECCO 2011","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G588053201","display_name":null,"funder_award_id":"EP/D052785/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W372717656","https://openalex.org/W1507360423","https://openalex.org/W1593495653","https://openalex.org/W1635549461","https://openalex.org/W1884986037","https://openalex.org/W1975791498","https://openalex.org/W1981482533","https://openalex.org/W1994258343","https://openalex.org/W2006072452","https://openalex.org/W2043084955","https://openalex.org/W2053099640","https://openalex.org/W2053175541","https://openalex.org/W2076588308","https://openalex.org/W2100137329","https://openalex.org/W2127379360","https://openalex.org/W2148494777","https://openalex.org/W2148770681","https://openalex.org/W2156622046","https://openalex.org/W2160241726","https://openalex.org/W2160436193","https://openalex.org/W2165220807","https://openalex.org/W2172117040","https://openalex.org/W2307983767","https://openalex.org/W2911346016","https://openalex.org/W2913346160"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W4299389082","https://openalex.org/W1943663474","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1829715381","https://openalex.org/W2014162767","https://openalex.org/W2115729582","https://openalex.org/W2809283963","https://openalex.org/W2367260997"],"abstract_inverted_index":{"Understanding":[0],"the":[1,12,29,35],"impact":[2],"of":[3,14,25,31],"crossover":[4,26],"on":[5,22,34],"performance":[6,30],"is":[7],"a":[8],"major":[9],"problem":[10],"in":[11],"theory":[13],"genetic":[15],"algorithms":[16],"(GAs).":[17],"We":[18],"present":[19],"new":[20],"insight":[21],"working":[23],"principles":[24],"by":[27],"analyzing":[28],"crossover-based":[32],"GAs":[33],"simple":[36],"functions":[37],"OneMax":[38],"and":[39],"Jump.":[40]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
