{"id":"https://openalex.org/W15803339","doi":"https://doi.org/10.1090/dimacs/035/13","title":"A branch and cut algorithm for MAX-SAT and weighted MAX-SAT","display_name":"A branch and cut algorithm for MAX-SAT and weighted MAX-SAT","publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W15803339","doi":"https://doi.org/10.1090/dimacs/035/13","mag":"15803339"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/13","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/13","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5078291126","display_name":"Steve Joy","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Steve Joy","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074563047","display_name":"John E. Mitchell","orcid":"https://orcid.org/0000-0001-5087-4679"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"John Mitchell","raw_affiliation_strings":["University of Calgary, Calgary, AB, Canada"],"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, AB, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061886949","display_name":"Brian Borchers","orcid":"https://orcid.org/0000-0001-5370-5811"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Borchers","raw_affiliation_strings":["University of Florida, Gainesville, FL"],"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, FL","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078291126"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":2.0541,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.84276239,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"519","last_page":"536"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9993000030517578,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6771169900894165},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.5607401132583618},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.552269697189331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5211398601531982},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5088667869567871},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5072876811027527},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5062472224235535},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5025899410247803},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4934026300907135},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.45369982719421387},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.442121297121048},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4124751687049866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3625906705856323},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33359163999557495},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18199920654296875},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15026354789733887},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.09644508361816406}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6771169900894165},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.5607401132583618},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.552269697189331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5211398601531982},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5088667869567871},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5072876811027527},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5062472224235535},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5025899410247803},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4934026300907135},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.45369982719421387},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.442121297121048},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4124751687049866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3625906705856323},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33359163999557495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18199920654296875},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15026354789733887},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.09644508361816406},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/035/13","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/13","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.82.424","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.82.424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euler.nmt.edu/~brian/dimacs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W18766686","https://openalex.org/W70153617","https://openalex.org/W202901394","https://openalex.org/W1528360848","https://openalex.org/W1667614912","https://openalex.org/W1976816453","https://openalex.org/W2011039300","https://openalex.org/W2029242918","https://openalex.org/W2088377032","https://openalex.org/W2092931458","https://openalex.org/W2099103397","https://openalex.org/W2100738443","https://openalex.org/W2170021258","https://openalex.org/W2808512824"],"related_works":["https://openalex.org/W1549765843","https://openalex.org/W1760270408","https://openalex.org/W1916519491","https://openalex.org/W2611506716","https://openalex.org/W1871270642","https://openalex.org/W2098087031","https://openalex.org/W2141353198","https://openalex.org/W2080871662","https://openalex.org/W2091563385","https://openalex.org/W3197571367"],"abstract_inverted_index":{"We":[0,48],"describe":[1],"a":[2,20,27],"branch":[3],"and":[4,10,44],"cut":[5],"algorithm":[6,14,51,63],"for":[7],"both":[8],"MAX-SAT":[9],"weighted":[11],"MAX-SAT.":[12],"This":[13],"uses":[15],"the":[16,33,56],"GSAT":[17],"procedure":[18],"as":[19],"primal":[21],"heuristic.":[22],"At":[23],"each":[24],"nodewe":[25],"solve":[26],"linear":[28],"programming":[29],"(LP)":[30],"relaxation":[31],"of":[32,37,55,84],"problem.":[34],"Two":[35],"styles":[36],"separating":[38],"cuts":[39,43],"are":[40],"added:":[41],"resolution":[42],"odd":[45],"cycle":[46],"inequalities.":[47],"compare":[49],"our":[50],"to":[52],"an":[53],"extension":[54],"Davis":[57],"Putnam":[58],"Loveland":[59],"(EDPL)":[60],"algorithm.":[61],"Our":[62],"is":[64,76],"more":[65,77],"e":[66,78],"ective":[67,79],"than":[68],"EDPL":[69,75],"on":[70,80],"some":[71,81],"problems,":[72],"notably":[73],"MAX-2-SAT.":[74],"other":[82],"classes":[83],"problems.":[85]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}