{"id":"https://openalex.org/W1536367001","doi":"https://doi.org/10.19139/83","title":"Efficient Binary Linear Programming Formulations for Boolean Functions","display_name":"Efficient Binary Linear Programming Formulations for Boolean Functions","alternate_titles":[],"publication_year":2014,"publication_date":"2014-11-21","ids":{"openalex":"https://openalex.org/W1536367001","doi":"https://doi.org/10.19139/83","mag":"1536367001"},"language":"en","primary_location":{"id":"doi:10.19139/83","doi":"https://doi.org/10.19139/83","is_oa":true,"landing_page_url":"https://doi.org/10.19139/83","pdf_url":null,"source":{"id":"https://openalex.org/S2764412775","display_name":"Statistics Optimization & Information Computing","issn_l":"2310-5070","issn":["2310-5070","2311-004X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310321236","host_organization_name":"International Academic Press","host_organization_lineage":["https://openalex.org/P4310321236"],"host_organization_lineage_names":["International Academic Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Statistics, Optimization &amp; Information Computing","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W1536367001"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.19139/83","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031299024","display_name":"Frank Gurski","orcid":"https://orcid.org/0000-0002-1212-1796","observed_orcids":["https://orcid.org/0000-0002-1212-1796"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Frank Gurski","raw_affiliation_strings":["University of Duesseldorf"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Duesseldorf","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031299024"],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":null,"apc_paid":null,"fwci":0.8485,"has_fulltext":true,"cited_by_count":14,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.64992826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":"2","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5830000042915344,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5830000042915344,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.31450000405311584,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.06729999929666519,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-linear-programming","display_name":"binary linear programming","score":0.9520000219345093},{"id":"https://openalex.org/keywords/boolean-functions","display_name":"Boolean functions","score":0.7409999966621399},{"id":"https://openalex.org/keywords/logical-operations","display_name":"logical operations","score":0.8069999814033508},{"id":"https://openalex.org/keywords/conjunctions","display_name":"conjunctions","score":0.7419999837875366},{"id":"https://openalex.org/keywords/disjunction","display_name":"disjunction","score":1.0},{"id":"https://openalex.org/keywords/equivalence","display_name":"equivalence","score":0.8289999961853027},{"id":"https://openalex.org/keywords/implication","display_name":"implication","score":0.9980000257492065},{"id":"https://openalex.org/keywords/compact-formulation","display_name":"compact formulation","score":0.6019999980926514},{"id":"https://openalex.org/keywords/variable-reduction","display_name":"variable reduction","score":0.3179999887943268}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7882451415061951},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6829306483268738},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6090923547744751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5812868475914001},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5758177042007446},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.544868528842926},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5067480206489563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5050526261329651},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.45598509907722473},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.44902005791664124},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44809818267822266},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4310705065727234},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.42843517661094666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38331979513168335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3692191541194916},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.23903244733810425},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.12768426537513733},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11895105242729187},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.19139/83","doi":"https://doi.org/10.19139/83","is_oa":true,"landing_page_url":"https://doi.org/10.19139/83","pdf_url":null,"source":{"id":"https://openalex.org/S2764412775","display_name":"Statistics Optimization & Information Computing","issn_l":"2310-5070","issn":["2310-5070","2311-004X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310321236","host_organization_name":"International Academic Press","host_organization_lineage":["https://openalex.org/P4310321236"],"host_organization_lineage_names":["International Academic Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Statistics, Optimization &amp; Information Computing","raw_type":"journal-article"},{"id":"doi:10.19139/soic.v2i4.83","doi":"https://doi.org/10.19139/soic.v2i4.83","is_oa":true,"landing_page_url":"https://doi.org/10.19139/soic.v2i4.83","pdf_url":"http://www.iapress.org/index.php/soic/article/download/20141201/187","source":{"id":"https://openalex.org/S2764412775","display_name":"Statistics Optimization & Information Computing","issn_l":"2310-5070","issn":["2310-5070","2311-004X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310321236","host_organization_name":"International Academic Press","host_organization_lineage":["https://openalex.org/P4310321236"],"host_organization_lineage_names":["International Academic Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Statistics, Optimization &amp; Information Computing","raw_type":"journal-article"},{"id":"pmh:oai:ojs.47.88.85.238:article/83","doi":null,"is_oa":true,"landing_page_url":"http://iapress.org/index.php/soic/article/view/20141201","pdf_url":null,"source":{"id":"https://openalex.org/S4306402441","display_name":"Statistics, Optimization & Information Computing (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Statistics, Optimization &amp; Information Computing; Vol 2, No 4 (2014); 274-279","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.19139/83","doi":"https://doi.org/10.19139/83","is_oa":true,"landing_page_url":"https://doi.org/10.19139/83","pdf_url":null,"source":{"id":"https://openalex.org/S2764412775","display_name":"Statistics Optimization & Information Computing","issn_l":"2310-5070","issn":["2310-5070","2311-004X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310321236","host_organization_name":"International Academic Press","host_organization_lineage":["https://openalex.org/P4310321236"],"host_organization_lineage_names":["International Academic Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Statistics, Optimization &amp; Information Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1536367001.pdf","grobid_xml":"https://content.openalex.org/works/W1536367001.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W104621033","https://openalex.org/W272982077","https://openalex.org/W404102259","https://openalex.org/W2011039300","https://openalex.org/W2167822297","https://openalex.org/W2496185699","https://openalex.org/W4243202427"],"related_works":["https://openalex.org/W7097626983","https://openalex.org/W1712173076","https://openalex.org/W2574400595","https://openalex.org/W2898299741","https://openalex.org/W4403304659","https://openalex.org/W1980921516","https://openalex.org/W2788003279","https://openalex.org/W7062446031","https://openalex.org/W2545743893","https://openalex.org/W794950876"],"abstract_inverted_index":{"A":[0],"very":[1],"useful":[2],"tool":[3],"when":[4],"designing":[5],"linear":[6,18,24,88],"programs":[7],"for":[8,56],"optimization":[9],"problems":[10],"is":[11,53],"the":[12,46,49,78],"formulation":[13,26],"of":[14,27],"logical":[15],"operations":[16],"by":[17,77],"programming":[19,25,89],"constraints.":[20,90],"We":[21],"give":[22,61],"efficient":[23],"important":[28],"n-ary":[29],"boolean":[30,42,71,81],"functions":[31],"f(x_1,\\ldots,x_n)=x_{n+1}":[32],"such":[33],"as":[34],"conjunction,":[35],"disjunction,":[36],"equivalence,":[37],"and":[38,84],"implication":[39],"using":[40],"n+1":[41],"variables":[43,82],"x1,...,x_{n+1}.":[44],"For":[45],"case":[47],"that":[48,68],"value":[50],"f(x1,":[51],"...,xn)":[52],"not":[54],"needed":[55],"further":[57],"computations,":[58],"we":[59],"even":[60],"more":[62],"compact":[63],"formulation.":[64],"Our":[65],"formulations":[66],"show":[67],"every":[69],"binary":[70],"function":[72],"f(x1,x2)=x3":[73],"can":[74],"be":[75],"realized":[76],"only":[79],"three":[80],"x1,x2,x3":[83],"at":[85],"most":[86],"four":[87]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1536367001","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
