{"id":"https://openalex.org/W3032256346","doi":"https://doi.org/10.1007/s10107-020-01512-2","title":"A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring","display_name":"A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring","publication_year":2020,"publication_date":"2020-05-25","ids":{"openalex":"https://openalex.org/W3032256346","doi":"https://doi.org/10.1007/s10107-020-01512-2","mag":"3032256346","pmid":"https://pubmed.ncbi.nlm.nih.gov/32863433"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-020-01512-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01512-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01512-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01512-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Elisabeth Gaar","orcid":"https://orcid.org/0000-0002-1643-6066"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Elisabeth Gaar","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Alpen-Adria-Universit\u00e4t Klagenfurt, Universit\u00e4tsstr. 65-67, 9020 Klagenfurt, Austria"],"raw_orcid":"https://orcid.org/0000-0002-1643-6066","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Alpen-Adria-Universit\u00e4t Klagenfurt, Universit\u00e4tsstr. 65-67, 9020 Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"last","author":{"id":null,"display_name":"Franz Rendl","orcid":"https://orcid.org/0000-0003-1578-9414"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Franz Rendl","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Alpen-Adria-Universit\u00e4t Klagenfurt, Universit\u00e4tsstr. 65-67, 9020 Klagenfurt, Austria"],"raw_orcid":"https://orcid.org/0000-0003-1578-9414","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Alpen-Adria-Universit\u00e4t Klagenfurt, Universit\u00e4tsstr. 65-67, 9020 Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210166741"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":1.0981,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.74511337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"183","issue":"1-2","first_page":"283","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.2976999878883362,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.2976999878883362,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.29600000381469727,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.17110000550746918,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7189000248908997},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5741000175476074},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47279998660087585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4172999858856201},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4099000096321106},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3874000012874603},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.38679999113082886},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.38269999623298645},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.3668999969959259}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7491000294685364},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7189000248908997},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5741000175476074},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47279998660087585},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42320001125335693},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4172999858856201},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.38269999623298645},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36730000376701355},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3377000093460083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3314000070095062},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.32739999890327454},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.3163999915122986},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.3019999861717224},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2827000021934509},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.2727999985218048},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-020-01512-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01512-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01512-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmid:32863433","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/32863433","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical programming","raw_type":null},{"id":"pmh:oai:arXiv.org:2006.04571","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.04571","pdf_url":"https://arxiv.org/pdf/2006.04571","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pubmedcentral.nih.gov:7441529","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7441529","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Math Program","raw_type":"Text"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:112274","is_oa":true,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/112274","pdf_url":null,"source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10107-020-01512-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01512-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01512-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1041234596","display_name":"Mixed-Integer Non-Linear Optimisation Applications","funder_award_id":"764759","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4563626322","display_name":"High-Performance Solvers for Binary Quadratic Problems","funder_award_id":"I 3199","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6261487271","display_name":"Relaxations for some NP-hard problems based on exact subgraphs","funder_award_id":"P 28008","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3032256346.pdf","grobid_xml":"https://content.openalex.org/works/W3032256346.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1607580485","https://openalex.org/W1861508522","https://openalex.org/W1964062286","https://openalex.org/W1969999211","https://openalex.org/W1985123706","https://openalex.org/W1986591158","https://openalex.org/W2009923109","https://openalex.org/W2033498477","https://openalex.org/W2049143039","https://openalex.org/W2051306216","https://openalex.org/W2065941671","https://openalex.org/W2066459185","https://openalex.org/W2078289947","https://openalex.org/W2081254453","https://openalex.org/W2085647652","https://openalex.org/W2091371007","https://openalex.org/W2092812429","https://openalex.org/W2100440346","https://openalex.org/W2106264302","https://openalex.org/W2132991500","https://openalex.org/W2526245011","https://openalex.org/W2766746521","https://openalex.org/W2952288495","https://openalex.org/W4247489173","https://openalex.org/W6600689414"],"related_works":[],"abstract_inverted_index":{"The":[0],"\"exact":[1],"subgraph\"":[2],"approach":[3],"was":[4],"recently":[5],"introduced":[6],"as":[7],"a":[8,28,43,57],"hierarchical":[9],"scheme":[10],"to":[11,50,77,85],"get":[12],"increasingly":[13],"tight":[14],"semidefinite":[15],"programming":[16],"relaxations":[17,26,48],"of":[18,32,37,105],"several":[19,70],"NP-hard":[20],"graph":[21],"optimization":[22,84],"problems.":[23],"Solving":[24],"these":[25,47,53],"is":[27],"computational":[29,44,91],"challenge":[30],"because":[31],"the":[33,63,75,79,87,94,102,106],"potentially":[34],"large":[35],"number":[36],"violated":[38],"subgraph":[39],"constraints.":[40],"We":[41,55],"introduce":[42],"framework":[45],"for":[46],"designed":[49],"cope":[51],"with":[52,109],"difficulties.":[54],"suggest":[56],"partial":[58],"Lagrangian":[59],"dual,":[60],"and":[61,98],"exploit":[62],"fact":[64],"that":[65],"its":[66],"evaluation":[67],"decomposes":[68],"into":[69],"independent":[71],"subproblems.":[72],"This":[73],"opens":[74],"way":[76],"use":[78],"bundle":[80],"method":[81],"from":[82],"non-smooth":[83],"minimize":[86],"dual":[88],"function.":[89],"Finally":[90],"experiments":[92],"on":[93],"Max-Cut,":[95],"stable":[96],"set":[97],"coloring":[99],"problem":[100],"show":[101],"excellent":[103],"quality":[104],"bounds":[107],"obtained":[108],"this":[110],"approach.":[111]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2020-06-05T00:00:00"}