{"id":"https://openalex.org/W4293211860","doi":"https://doi.org/10.1137/21m1419775","title":"A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem","display_name":"A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem","publication_year":2022,"publication_date":"2022-08-24","ids":{"openalex":"https://openalex.org/W4293211860","doi":"https://doi.org/10.1137/21m1419775"},"language":"en","primary_location":{"id":"doi:10.1137/21m1419775","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1419775","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5029500446","display_name":"Sergiy Butenko","orcid":"https://orcid.org/0000-0002-6662-9552"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sergiy Butenko","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044989382","display_name":"Mykyta Makovenko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mykyta Makovenko","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082460498","display_name":"Miltiades Pardalos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Miltiades Pardalos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029500446"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4382,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64732513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"32","issue":"3","first_page":"2102","last_page":"2128"},"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.9998999834060669,"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.9998999834060669,"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.9991000294685364,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7990288734436035},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6882703900337219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6871154308319092},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6350323557853699},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5283549427986145},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4559186100959778},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4462175667285919},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.43157321214675903},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.41466620564460754},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40125149488449097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3303403854370117},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.16142487525939941},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09883975982666016}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7990288734436035},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6882703900337219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6871154308319092},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6350323557853699},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5283549427986145},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4559186100959778},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4462175667285919},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.43157321214675903},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.41466620564460754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40125149488449097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3303403854370117},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.16142487525939941},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09883975982666016},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1419775","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1419775","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6156356210","display_name":null,"funder_award_id":"FA9550-19-1-0161","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W168026768","https://openalex.org/W1481481825","https://openalex.org/W1498403778","https://openalex.org/W1546734293","https://openalex.org/W1549791526","https://openalex.org/W1884347414","https://openalex.org/W1964823285","https://openalex.org/W1967344706","https://openalex.org/W2013568176","https://openalex.org/W2027470314","https://openalex.org/W2037982899","https://openalex.org/W2049143039","https://openalex.org/W2065704444","https://openalex.org/W2071702553","https://openalex.org/W2074614998","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2082864800","https://openalex.org/W2099168123","https://openalex.org/W2106264302","https://openalex.org/W2117713290","https://openalex.org/W2120146316","https://openalex.org/W2128762995","https://openalex.org/W2401610261","https://openalex.org/W2610183793","https://openalex.org/W2730722516","https://openalex.org/W2939980816","https://openalex.org/W2963121468","https://openalex.org/W3035434998","https://openalex.org/W3086620436","https://openalex.org/W3092908795","https://openalex.org/W3124804635","https://openalex.org/W3141230086","https://openalex.org/W4248469012"],"related_works":["https://openalex.org/W90488856","https://openalex.org/W2921972394","https://openalex.org/W4286824753","https://openalex.org/W2896357665","https://openalex.org/W4289388956","https://openalex.org/W2766144424","https://openalex.org/W2039582986","https://openalex.org/W4319602674","https://openalex.org/W3164101730","https://openalex.org/W2186006531"],"abstract_inverted_index":{"The":[0,116],"maximum":[1,84,158],"clique":[2,35,85,89],"problem":[3,8,26],"is":[4,129,141,161],"a":[5,44,73,93,102,142],"classical":[6],"optimization":[7],"which":[9],"finds":[10],"many":[11],"important":[12],"applications.":[13],"Some":[14],"of":[15,39,43,75,92,101,107,118,136,139,144,147,150,159],"the":[16,30,34,40,83,88,97,111,122,126,131,134,145],"most":[17],"theoretically":[18],"interesting":[19],"and":[20,61,125],"computationally":[21],"successful":[22],"approaches":[23],"to":[24,96,121],"this":[25,70],"are":[27],"based":[28],"on":[29],"Motzkin--Straus":[31,123],"formulation,":[32,124],"expressing":[33],"number":[36,90],"in":[37,56,63,114,130],"terms":[38],"maximal":[41,99],"value":[42,100],"standard":[45,112],"quadratic":[46,57],"program.":[47],"This":[48],"intriguing":[49],"relationship":[50],"has":[51],"also":[52],"motivated":[53],"significant":[54],"developments":[55],"optimization,":[58],"copositive":[59],"programming,":[60],"complexity":[62],"nonlinear":[64],"optimization.":[65],"Inspired":[66],"by":[67],"such":[68],"developments,":[69],"paper":[71],"establishes":[72],"hierarchy":[74],"polynomial":[76,104],"programming":[77],"formulations":[78],"(\\textbfP$^k$),":[79],"$k\\in\\{2,\\ldots,":[80,152],"\\omega\\}$":[81],"for":[82],"problem,":[86],"relating":[87],"$\\omega$":[91],"given":[94],"graph":[95],"global":[98],"multilinear":[103],"function":[105],"$f_k(x)$":[106],"degree":[108],"$k$":[109],"over":[110],"simplex":[113],"$\\mathbb{R}^{|V|}$.":[115],"case":[117],"$k=2$":[119],"corresponds":[120],"hierarchical":[127],"feature":[128],"fact":[132],"that":[133],"set":[135,146],"local":[137,148,157],"maxima":[138,149],"(\\textbfP$^{k+1}$)":[140],"subset":[143],"(\\textbfP$^{k}$),":[151],"\\omega-1\\}$.":[153],"In":[154],"particular,":[155],"every":[156],"(\\textbfP$^{\\omega}$)":[160],"global.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}