{"id":"https://openalex.org/W1541290429","doi":"https://doi.org/10.3233/sat190065","title":"Terse Integer Linear Programs for Boolean Optimization","display_name":"Terse Integer Linear Programs for Boolean Optimization","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W1541290429","doi":"https://doi.org/10.3233/sat190065","mag":"1541290429"},"language":"en","primary_location":{"id":"doi:10.3233/sat190065","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190065","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190065?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190065","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190065?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190065","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066641730","display_name":"Christoph Buchheim","orcid":"https://orcid.org/0000-0001-9974-404X"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Buchheim","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, 50969 K\u00f6ln, Germany. E-mail:\u00a0buchheim@informatik.uni-koeln.de","Universitaet Zu Koeln"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, 50969 K\u00f6ln, Germany. E-mail:\u00a0buchheim@informatik.uni-koeln.de","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Universitaet Zu Koeln","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103158920","display_name":"Giovanni Rinaldi","orcid":"https://orcid.org/0000-0003-0148-2470"},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Rinaldi","raw_affiliation_strings":["Istituto di Analisi dei Sistemi ed Informatica \u201cAntonio Ruberti\u201d del CNR, viale Manzoni 30, 00185 Roma, Italy. E-mail:\u00a0rinaldi@iasi.cnr.it"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica \u201cAntonio Ruberti\u201d del CNR, viale Manzoni 30, 00185 Roma, Italy. E-mail:\u00a0rinaldi@iasi.cnr.it","institution_ids":["https://openalex.org/I4210162062"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7091,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69031986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":"1-3","first_page":"121","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9954000115394592,"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/integer","display_name":"Integer (computer science)","score":0.6096692085266113},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5009253025054932},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43045175075531006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3726646304130554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2828673720359802},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18278753757476807}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6096692085266113},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5009253025054932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43045175075531006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3726646304130554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2828673720359802},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18278753757476807}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3233/sat190065","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190065","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190065?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190065","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:USBKOELN.ub.uni-koeln.de:54921","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-9974-404X>","pdf_url":null,"source":{"id":"https://openalex.org/S4306400371","display_name":"K\u00f6lner Universit\u00e4ts PublikationsServer (Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210115942","host_organization_name":"Rhenish Institute for Environmental Research","host_organization_lineage":["https://openalex.org/I4210115942"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:558","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.98","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.98","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jsat.ewi.tudelft.nl/content/volume6/JSAT6_7_Buchheim.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3233/sat190065","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190065","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190065?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190065","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321012","display_name":"Technische Universiteit Delft","ror":"https://ror.org/02e2c7k09"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1541290429.pdf","grobid_xml":"https://content.openalex.org/works/W1541290429.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W15803339","https://openalex.org/W111060146","https://openalex.org/W153078869","https://openalex.org/W1492193787","https://openalex.org/W2012605254","https://openalex.org/W2029242918","https://openalex.org/W2066253573","https://openalex.org/W2074078071","https://openalex.org/W2100577981","https://openalex.org/W2103184499","https://openalex.org/W2118825986","https://openalex.org/W2148016452","https://openalex.org/W2158907148","https://openalex.org/W6600642310","https://openalex.org/W6604473126","https://openalex.org/W6606190870"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2082154838","https://openalex.org/W2109912052","https://openalex.org/W1711527768"],"abstract_inverted_index":{"We":[0,31],"present":[1],"a":[2,26,56,80,115,118],"new":[3],"polyhedral":[4],"approach":[5],"to":[6,11,47,61,75,99,103,131],"nonlinear":[7],"Boolean":[8],"optimization.":[9],"Compared":[10],"other":[12],"methods,":[13],"it":[14,22],"produces":[15],"much":[16],"smaller":[17],"integer":[18],"programming":[19],"models,":[20],"making":[21],"more":[23],"efficient":[24,82],"from":[25],"practical":[27],"point":[28],"of":[29,64,89,117],"view.":[30],"mainly":[32],"obtain":[33],"this":[34],"by":[35,84],"two":[36],"different":[37],"ideas:":[38],"first,":[39],"we":[40,71,108],"do":[41],"not":[42],"require":[43],"the":[44,62,73,76,87,90,104,111,132,135],"objective":[45],"function":[46],"be":[48,100],"in":[49,79,122],"any":[50],"normal":[51,57],"form.":[52],"The":[53,94],"transformation":[54],"into":[55],"form":[58],"usually":[59],"leads":[60],"introduction":[63],"many":[65],"additional":[66],"variables":[67],"or":[68],"constraints.":[69],"Second,":[70],"reduce":[72],"problem":[74,129],"degree-two":[77],"case":[78],"very":[81],"way,":[83],"slightly":[85],"extending":[86],"dimension":[88],"original":[91],"variable":[92],"space.":[93],"resulting":[95],"model":[96],"turns":[97],"out":[98],"closely":[101],"related":[102],"maximum":[105,136],"cut":[106,120,137],"problem;":[107],"show":[109],"that":[110],"corresponding":[112],"polytope":[113,121],"is":[114],"face":[116],"suitable":[119],"most":[123],"cases.":[124],"In":[125],"particular,":[126],"our":[127],"separation":[128],"reduces":[130],"one":[133],"for":[134],"problem.":[138]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}