{"id":"https://openalex.org/W121484681","doi":"https://doi.org/10.3233/sat190001","title":"Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems","display_name":"Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems","publication_year":2005,"publication_date":"2005-08-01","ids":{"openalex":"https://openalex.org/W121484681","doi":"https://doi.org/10.3233/sat190001","mag":"121484681"},"language":"en","primary_location":{"id":"doi:10.3233/sat190001","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190001","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190001?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190001","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/sat190001?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190001","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Miguel F. Anjos","raw_affiliation_strings":["Department of Management Sciences, Faculty of Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. E-mail:\u00a0anjos@stanfordalumni.org"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, Faculty of Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. E-mail:\u00a0anjos@stanfordalumni.org","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005540131"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":1.3466,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80073925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9975000023841858,"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/T10142","display_name":"Formal Methods in Verification","score":0.9965000152587891,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.9421082735061646},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.8904929161071777},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7319149374961853},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6250921487808228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.579738974571228},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.5405461192131042},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5090612769126892},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45978501439094543},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.4521489441394806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4433671832084656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3566295802593231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3133249580860138},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30196255445480347},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.15387296676635742},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07234740257263184}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.9421082735061646},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.8904929161071777},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7319149374961853},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6250921487808228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.579738974571228},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.5405461192131042},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5090612769126892},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45978501439094543},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4521489441394806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4433671832084656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3566295802593231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3133249580860138},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30196255445480347},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.15387296676635742},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07234740257263184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3233/sat190001","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190001","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190001?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190001","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:CiteSeerX.psu:10.1.1.151.6898","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.6898","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/volume1/JSAT1_1_Anjos.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.392.7580","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.7580","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/old/JSAT1_1_Anjos.pdf","raw_type":"text"},{"id":"pmh:oai:publications.polymtl.ca:38300","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/38300/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":{"id":"doi:10.3233/sat190001","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190001","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190001?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190001","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":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W121484681.pdf","grobid_xml":"https://content.openalex.org/works/W121484681.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W5795904","https://openalex.org/W157138717","https://openalex.org/W1487965496","https://openalex.org/W1491901203","https://openalex.org/W1505281405","https://openalex.org/W1518383689","https://openalex.org/W1540352354","https://openalex.org/W1558129180","https://openalex.org/W1576805635","https://openalex.org/W1893254807","https://openalex.org/W1951390451","https://openalex.org/W1967184028","https://openalex.org/W1970193303","https://openalex.org/W1974563688","https://openalex.org/W1985123706","https://openalex.org/W1986005884","https://openalex.org/W1987579904","https://openalex.org/W1997672673","https://openalex.org/W1999032440","https://openalex.org/W1999913571","https://openalex.org/W2001564241","https://openalex.org/W2018025029","https://openalex.org/W2023710022","https://openalex.org/W2035016254","https://openalex.org/W2036265926","https://openalex.org/W2038690430","https://openalex.org/W2040924621","https://openalex.org/W2043506441","https://openalex.org/W2049143039","https://openalex.org/W2050091725","https://openalex.org/W2050958701","https://openalex.org/W2063897357","https://openalex.org/W2072545857","https://openalex.org/W2074116126","https://openalex.org/W2077397558","https://openalex.org/W2078289947","https://openalex.org/W2080263450","https://openalex.org/W2089028944","https://openalex.org/W2091560152","https://openalex.org/W2092931458","https://openalex.org/W2106264302","https://openalex.org/W2109039359","https://openalex.org/W2116753372","https://openalex.org/W2125448650","https://openalex.org/W2133184112","https://openalex.org/W2133527541","https://openalex.org/W2136811867","https://openalex.org/W2137373403","https://openalex.org/W2158907148","https://openalex.org/W2160258662","https://openalex.org/W2210840110","https://openalex.org/W2495457432","https://openalex.org/W2506277857","https://openalex.org/W2576009865","https://openalex.org/W2610857016","https://openalex.org/W4245630182","https://openalex.org/W4300645277"],"related_works":["https://openalex.org/W2364528045","https://openalex.org/W2348903644","https://openalex.org/W1653317167","https://openalex.org/W2737505353","https://openalex.org/W2385886188","https://openalex.org/W2370797736","https://openalex.org/W3154036230","https://openalex.org/W2369616053","https://openalex.org/W2366269287","https://openalex.org/W121484681"],"abstract_inverted_index":{"Semidefinite":[0],"optimization,":[1],"commonly":[2],"referred":[3],"to":[4],"as":[5],"semidefinite":[6,27],"programming,":[7],"has":[8,29],"been":[9],"a":[10,31],"remarkably":[11],"active":[12],"area":[13],"of":[14],"research":[15],"in":[16,25],"optimization":[17],"during":[18],"the":[19],"last":[20],"decade.":[21],"For":[22],"combinatorial":[23],"problems":[24],"particular,":[26],"programming":[28],"had":[30],"truly":[32],"sign":[33]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}