{"id":"https://openalex.org/W2052462659","doi":"https://doi.org/10.1109/cec.2011.5949688","title":"On robustness of permutations sequencing operators: Solving satisfiability of random 3 \u2014 CNFs by simple crossover","display_name":"On robustness of permutations sequencing operators: Solving satisfiability of random 3 \u2014 CNFs by simple crossover","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2052462659","doi":"https://doi.org/10.1109/cec.2011.5949688","mag":"2052462659"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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/A5080810815","display_name":"Marco Carpentieri","orcid":null},"institutions":[{"id":"https://openalex.org/I20272500","display_name":"University of Basilicata","ror":"https://ror.org/03tc05689","country_code":"IT","type":"education","lineage":["https://openalex.org/I20272500"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Carpentieri","raw_affiliation_strings":["Dipartimento di Matematica ed Informatica, Universitá della Basilicata, Via dell'Ateneo Lucano 10, Potenza, Italy","Dipartimento di Matematica ed Informatica, Universit\u00e1 della Basilicata, Via dell'Ateneo Lucano 10, Potenza, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica ed Informatica, Universitá della Basilicata, Via dell'Ateneo Lucano 10, Potenza, Italy","institution_ids":["https://openalex.org/I20272500"]},{"raw_affiliation_string":"Dipartimento di Matematica ed Informatica, Universit\u00e1 della Basilicata, Via dell'Ateneo Lucano 10, Potenza, Italy","institution_ids":["https://openalex.org/I20272500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080810815"],"corresponding_institution_ids":["https://openalex.org/I20272500"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1412481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"707","last_page":"714"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.713065505027771},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6942445635795593},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6465901136398315},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5718644261360168},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5537779331207275},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.48753830790519714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4775446355342865},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4551309645175934},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.4200344979763031},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4154564440250397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3901926279067993},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34649142622947693},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3440449833869934},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3232726454734802},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.2701164484024048},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.2001240849494934},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1536450982093811},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11434522271156311}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.713065505027771},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6942445635795593},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6465901136398315},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5718644261360168},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5537779331207275},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.48753830790519714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4775446355342865},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4551309645175934},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.4200344979763031},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4154564440250397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3901926279067993},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34649142622947693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3440449833869934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3232726454734802},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2701164484024048},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2001240849494934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1536450982093811},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11434522271156311},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2011.5949688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W17748033","https://openalex.org/W19646579","https://openalex.org/W43336110","https://openalex.org/W209138504","https://openalex.org/W242035403","https://openalex.org/W1504140168","https://openalex.org/W1534832769","https://openalex.org/W1559492868","https://openalex.org/W1576660662","https://openalex.org/W1589975099","https://openalex.org/W1596568617","https://openalex.org/W1598952354","https://openalex.org/W1628175853","https://openalex.org/W1659842140","https://openalex.org/W1965159555","https://openalex.org/W1974769464","https://openalex.org/W1985123706","https://openalex.org/W2008099090","https://openalex.org/W2017542549","https://openalex.org/W2036265926","https://openalex.org/W2051682049","https://openalex.org/W2057640509","https://openalex.org/W2061496873","https://openalex.org/W2107197669","https://openalex.org/W2141003493","https://openalex.org/W2151554678","https://openalex.org/W2152631195","https://openalex.org/W2158254879","https://openalex.org/W2327117606","https://openalex.org/W2401610261","https://openalex.org/W2752885492","https://openalex.org/W2767274307","https://openalex.org/W2886662231","https://openalex.org/W2952923218","https://openalex.org/W3023540311","https://openalex.org/W3104952918","https://openalex.org/W4243643814","https://openalex.org/W4255627481","https://openalex.org/W4302339081","https://openalex.org/W6600203084","https://openalex.org/W6600690991","https://openalex.org/W6608404185","https://openalex.org/W6634475230","https://openalex.org/W6635336068","https://openalex.org/W6745815690","https://openalex.org/W7018068060"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W1913543287","https://openalex.org/W2336941104","https://openalex.org/W3120153087"],"abstract_inverted_index":{"Permutations":[0],"sequencing":[1],"operators":[2],"have":[3],"been":[4],"proved":[5],"to":[6,64,108,110],"be":[7],"effective":[8,105],"in":[9,24,48,75,106],"solving":[10],"(mild":[11],"restrictions":[12],"of)":[13],"randomized":[14],"hard":[15],"problems":[16],"such":[17],"as":[18],"that":[19,83],"of":[20,37,40,56,68,71,92],"finding":[21],"Hamiltonian":[22],"cycles":[23],"random":[25,45,116],"graphs":[26],"(with":[27],"suitable":[28],"edge":[29],"densities).":[30],"We":[31,78],"introduce":[32],"a":[33,65,84,93],"simple":[34,73,85],"polynomial":[35],"reduction":[36],"the":[38,69,90,112],"problem":[39,70,114],"computing":[41,72],"satisfiability":[42,113],"assignments":[43],"for":[44],"boolean":[46],"formulas":[47],"conjunctive":[49],"normal":[50],"form":[51],"and":[52,100],"with":[53],"clauses":[54],"consisting":[55],"exactly":[57],"three":[58],"literals":[59],"(random":[60],"3":[61,117],"-":[62,118],"CNFs)":[63],"constrained":[66],"variant":[67],"paths":[74],"undirected":[76],"graphs.":[77],"provide":[79],"experimental":[80],"results":[81],"evidencing":[82],"crossover":[86],"technique,":[87],"incorporated":[88],"into":[89],"framework":[91],"memetic":[94],"model,":[95],"inspired":[96],"by":[97,122],"Sexual":[98],"Selection":[99],"Elitist/Evolution":[101],"Strategy":[102],"principles,":[103],"is":[104],"practice":[107],"try":[109],"solve":[111],"(for":[115],"CNF":[119],"instances":[120],"satisfiable":[121],"hidden":[123],"assignments).":[124]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}