{"id":"https://openalex.org/W2794042100","doi":"https://doi.org/10.1142/s0218126618501633","title":"A Nonlinear Integer Programming Approach for the Minimization of Boolean Expressions","display_name":"A Nonlinear Integer Programming Approach for the Minimization of Boolean Expressions","publication_year":2018,"publication_date":"2018-01-22","ids":{"openalex":"https://openalex.org/W2794042100","doi":"https://doi.org/10.1142/s0218126618501633","mag":"2794042100"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126618501633","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126618501633","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-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/A5103246795","display_name":"Konstantinos G. Papakonstantinou","orcid":"https://orcid.org/0000-0002-5254-1066"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. G. Papakonstantinou","raw_affiliation_strings":["Department of Civil and Environmental Engineering, The Pennsylvania State University, University Park, PA 16802, USA"],"raw_orcid":"https://orcid.org/0000-0002-5254-1066","affiliations":[{"raw_affiliation_string":"Department of Civil and Environmental Engineering, The Pennsylvania State University, University Park, PA 16802, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012894628","display_name":"G. Papakonstantinou","orcid":"https://orcid.org/0000-0002-3434-0877"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"G. Papakonstantinou","raw_affiliation_strings":["School of Electrical and Computer Engineering, National Technical University of Athens, Zografou Campus, Athens 15780, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, National Technical University of Athens, Zografou Campus, Athens 15780, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6181,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69646975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"10","first_page":"1850163","last_page":"1850163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.6304556131362915},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6299349069595337},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6132675409317017},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.5392391085624695},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5003445148468018},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49226894974708557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47377848625183105},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4678044617176056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46059879660606384},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.431405246257782},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4302389919757843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4270501732826233},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.41227617859840393},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41169142723083496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32607799768447876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32102668285369873}],"concepts":[{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.6304556131362915},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6299349069595337},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6132675409317017},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.5392391085624695},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5003445148468018},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49226894974708557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47377848625183105},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4678044617176056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46059879660606384},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.431405246257782},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4302389919757843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4270501732826233},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.41227617859840393},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41169142723083496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32607799768447876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32102668285369873},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126618501633","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126618501633","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1971536112","https://openalex.org/W1996351852","https://openalex.org/W2016085168","https://openalex.org/W2022879129","https://openalex.org/W2035072927","https://openalex.org/W2039098229","https://openalex.org/W2051044287","https://openalex.org/W2054925107","https://openalex.org/W2058451772","https://openalex.org/W2074140156","https://openalex.org/W2098878195","https://openalex.org/W2124869406","https://openalex.org/W2143806343"],"related_works":["https://openalex.org/W2234833091","https://openalex.org/W1568384982","https://openalex.org/W2011469629","https://openalex.org/W2567187083","https://openalex.org/W1496352327","https://openalex.org/W3049502754","https://openalex.org/W1745650241","https://openalex.org/W2995617542","https://openalex.org/W2724189404","https://openalex.org/W1501085929"],"abstract_inverted_index":{"A":[0,45],"novel":[1],"approach":[2,118],"is":[3,15,33,36,47,79,87,98],"suggested":[4,85],"in":[5,18,102],"this":[6],"paper":[7],"for":[8,81,90],"the":[9,30,51,54,59,91,103,112,117],"minimization":[10,92],"of":[11,93,116],"Boolean":[12,55,104],"expressions.":[13],"This":[14],"particularly":[16],"useful":[17],"logic":[19,26],"synthesis,":[20],"since":[21],"it":[22],"leads":[23],"to":[24,49,58,110],"simpler":[25],"circuit":[27],"implementations.":[28],"Although":[29],"proposed":[31],"method":[32],"general,":[34],"emphasis":[35],"given":[37],"on":[38],"Exclusive-or":[39],"Sum":[40],"Of":[41],"Products":[42],"(ESOPs)":[43],"functions.":[44],"transformation":[46],"derived":[48],"convert":[50],"problem":[52,65,101],"from":[53],"algebra":[56],"area":[57],"classical":[60],"algebraic":[61],"area.":[62,105],"The":[63,84,125],"resulting":[64,126],"becomes":[66],"a":[67,99],"nonlinear,":[68],"integer":[69],"program":[70],"and":[71,114,119],"an":[72],"original":[73],"branch-and-bound":[74],"procedure":[75],"with":[76],"several":[77],"relaxations":[78],"developed":[80],"its":[82],"solution.":[83],"methodology":[86],"especially":[88],"suitable":[89],"incompletely":[94],"specified":[95],"functions,":[96],"which":[97],"difficult":[100],"Numerical":[106],"examples":[107],"are":[108,123],"provided":[109],"demonstrate":[111],"applicability":[113],"performance":[115],"possible":[120],"future":[121],"directions":[122],"described.":[124],"nonlinear":[127],"problems":[128],"can":[129],"sometimes":[130],"be":[131],"very":[132],"demanding":[133],"but":[134],"their":[135],"challenging":[136],"solutions":[137],"could":[138],"solve":[139],"open":[140],"ESOP":[141],"problems.":[142]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}