{"id":"https://openalex.org/W2493958097","doi":"https://doi.org/10.1145/2908812.2908869","title":"Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems","display_name":"Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2493958097","doi":"https://doi.org/10.1145/2908812.2908869","mag":"2493958097"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908869","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059074668","display_name":"Francisco Chicano","orcid":"https://orcid.org/0000-0003-1259-2990"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Francisco Chicano","raw_affiliation_strings":["University of Malaga, Malaga, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Malaga, Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001932161","display_name":"Darrell Whitley","orcid":"https://orcid.org/0000-0002-2752-6534"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darrell Whitley","raw_affiliation_strings":["Colorado State University, Fort Collins, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040638379","display_name":"Renato Tin\u00f3s","orcid":"https://orcid.org/0000-0003-4027-8851"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Renato Tinos","raw_affiliation_strings":["University of Sao Paulo, Riberao Preto, SP, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, Riberao Preto, SP, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9922000169754028,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9922000169754028,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9884999990463257,"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/T12534","display_name":"Protein Degradation and Inhibitors","score":0.9544000029563904,"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/boolean-function","display_name":"Boolean function","score":0.7153414487838745},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.6442246437072754},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6322695016860962},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6121065616607666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4862464666366577},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4757140278816223},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.46853628754615784},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4393305778503418},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4339563846588135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42190396785736084},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4168434739112854},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4108666181564331},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40293025970458984},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3585175573825836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3424718976020813}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7153414487838745},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.6442246437072754},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6322695016860962},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6121065616607666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4862464666366577},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4757140278816223},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46853628754615784},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4393305778503418},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4339563846588135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42190396785736084},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4168434739112854},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4108666181564331},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40293025970458984},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3585175573825836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3424718976020813},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2908812.2908869","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"},{"id":"pmh:oai:riuma.uma.es:10630/11979","is_oa":false,"landing_page_url":"http://hdl.handle.net/10630/11979","pdf_url":null,"source":{"id":"https://openalex.org/S4306401385","display_name":"Repositorio Institucional de la Universidad de M\u00e1laga (University of M\u00e1laga)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82767444","host_organization_name":"Universidad de M\u00e1laga","host_organization_lineage":["https://openalex.org/I82767444"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G2869337368","display_name":null,"funder_award_id":"TIN2014-57341-R","funder_id":"https://openalex.org/F4320321837","funder_display_name":"Ministerio de Econom\u00eda y Competitividad"},{"id":"https://openalex.org/G4942627165","display_name":null,"funder_award_id":"FA9550-11-1-0088","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5700904287","display_name":null,"funder_award_id":"CAS12/00274","funder_id":"https://openalex.org/F4320321764","funder_display_name":"Ministerio de Educaci\u00f3n, Cultura y Deporte"}],"funders":[{"id":"https://openalex.org/F4320321764","display_name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","ror":"https://ror.org/03nc27g21"},{"id":"https://openalex.org/F4320321837","display_name":"Ministerio de Econom\u00eda y Competitividad","ror":"https://ror.org/034900433"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W83318913","https://openalex.org/W1591939288","https://openalex.org/W1878874404","https://openalex.org/W1994065760","https://openalex.org/W2030398195","https://openalex.org/W2045698148","https://openalex.org/W2073347800","https://openalex.org/W2073819677","https://openalex.org/W2114637266","https://openalex.org/W2119801831","https://openalex.org/W2148784205","https://openalex.org/W2252640007","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2995617542","https://openalex.org/W1972685147","https://openalex.org/W2615739385","https://openalex.org/W2132980130","https://openalex.org/W2292828258","https://openalex.org/W2014833376","https://openalex.org/W3141532631","https://openalex.org/W2131164334","https://openalex.org/W2166214692","https://openalex.org/W2613742296"],"abstract_inverted_index":{"Efficient":[0],"hill":[1,48,148],"climbers":[2],"have":[3,56],"been":[4,32],"recently":[5],"proposed":[6],"for":[7,126],"single-":[8],"and":[9,68],"multi-objective":[10,127],"pseudo-Boolean":[11,16,115,129,139],"optimization":[12,116,130],"problems.":[13,117,131],"For":[14],"k-bounded":[15,128],"functions":[17,89],"where":[18,78],"each":[19],"variable":[20],"appears":[21],"in":[22,44,65,146],"at":[23],"most":[24],"a":[25,39,52,142],"constant":[26,45],"number":[27],"of":[28,38,61,83,86,101],"subfunctions,":[29],"it":[30],"has":[31,141],"theoretically":[33],"proven":[34],"that":[35,107,134],"the":[36,62,70,73,84,87,95,103,123,138,147],"neighborhood":[37],"solution":[40],"can":[41,109],"be":[42,111],"explored":[43],"time.":[46],"These":[47],"climbers,":[49],"combined":[50],"with":[51],"high-level":[53],"exploration":[54],"strategy,":[55],"shown":[57],"to":[58,72,92,113,137],"improve":[59],"state":[60],"art":[63],"methods":[64],"experimental":[66],"studies":[67],"open":[69],"door":[71],"so-called":[74],"Gray":[75],"Box":[76],"Optimization,":[77],"part,":[79],"but":[80],"not":[81],"all,":[82],"details":[85],"objective":[88],"are":[90],"used":[91],"better":[93],"explore":[94],"search":[96],"space.":[97],"One":[98],"important":[99],"limitation":[100],"all":[102],"previous":[104],"proposals":[105],"is":[106],"they":[108],"only":[110],"applied":[112],"unconstrained":[114],"In":[118],"this":[119],"work,":[120],"we":[121],"address":[122],"constrained":[124],"case":[125],"We":[132],"find":[133],"adding":[135],"constraints":[136],"problem":[140],"linear":[143],"computational":[144],"cost":[145],"climber.":[149]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}