{"id":"https://openalex.org/W1984322914","doi":"https://doi.org/10.1007/s10472-005-7036-z","title":"Improving exact algorithms for MAX-2-SAT","display_name":"Improving exact algorithms for MAX-2-SAT","publication_year":2005,"publication_date":"2005-08-01","ids":{"openalex":"https://openalex.org/W1984322914","doi":"https://doi.org/10.1007/s10472-005-7036-z","mag":"1984322914"},"language":"en","primary_location":{"id":"doi:10.1007/s10472-005-7036-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10472-005-7036-z","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics and Artificial Intelligence","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/A5102020267","display_name":"Haiou Shen","orcid":"https://orcid.org/0000-0001-6772-0502"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haiou Shen","raw_affiliation_strings":["Computer Science Department, The University of Iowa, Iowa City, IA, 52242, USA","Computer Science Department, The University of Iowa, Iowa City, USA 52242#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, IA, 52242, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, USA 52242#TAB#","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039343417","display_name":"Hantao Zhang","orcid":"https://orcid.org/0000-0003-1203-7997"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hantao Zhang","raw_affiliation_strings":["Computer Science Department, The University of Iowa, Iowa City, IA, 52242, USA","Computer Science Department, The University of Iowa, Iowa City, USA 52242#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, IA, 52242, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Computer Science Department, The University of Iowa, Iowa City, USA 52242#TAB#","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102020267"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.6437,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.86224398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"44","issue":"4","first_page":"419","last_page":"436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.97079998254776,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.97079998254776,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9635000228881836,"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/variable","display_name":"Variable (mathematics)","score":0.6102672815322876},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6038403511047363},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5808596611022949},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.57227623462677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5281864404678345},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4822148084640503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4580466151237488},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41764116287231445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3674340844154358},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34614360332489014},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2779971659183502}],"concepts":[{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6102672815322876},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6038403511047363},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5808596611022949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57227623462677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5281864404678345},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4822148084640503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4580466151237488},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41764116287231445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3674340844154358},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34614360332489014},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2779971659183502},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10472-005-7036-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10472-005-7036-z","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics and Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.116.7715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.7715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.imaging.sbes.vt.edu/~hshen/publications/aim2004.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.7245","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rutcor.rutgers.edu/~amai/aimath04/AcceptedPapers/Shen-aimath04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.3741","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.3741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiowa.edu/~hshen/maxsat_aim2004.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W17690413","https://openalex.org/W19577439","https://openalex.org/W70153617","https://openalex.org/W1491051759","https://openalex.org/W1506775176","https://openalex.org/W1513769081","https://openalex.org/W1516863390","https://openalex.org/W1530962882","https://openalex.org/W1564428908","https://openalex.org/W1581661059","https://openalex.org/W1686746446","https://openalex.org/W1896404939","https://openalex.org/W1984322914","https://openalex.org/W1993837454","https://openalex.org/W2006933117","https://openalex.org/W2031823362","https://openalex.org/W2036185701","https://openalex.org/W2049991966","https://openalex.org/W2057361103","https://openalex.org/W2126446661","https://openalex.org/W2154474334","https://openalex.org/W2171680292","https://openalex.org/W2506088122","https://openalex.org/W2560168938","https://openalex.org/W2998050925","https://openalex.org/W4235529266"],"related_works":["https://openalex.org/W3020890412","https://openalex.org/W2366206435","https://openalex.org/W1588356204","https://openalex.org/W1968337573","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W1931020284","https://openalex.org/W4319942994","https://openalex.org/W2182290077","https://openalex.org/W3013962532"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}