{"id":"https://openalex.org/W2158095962","doi":"https://doi.org/10.1137/140966332","title":"Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms","display_name":"Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2158095962","doi":"https://doi.org/10.1137/140966332","mag":"2158095962"},"language":"en","primary_location":{"id":"doi:10.1137/140966332","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140966332","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":true,"oa_status":"green","oa_url":"https://eprints.lancs.ac.uk/id/eprint/74728/1/ellipsoids_source.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021126920","display_name":"Monia Giandomenico","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Monia Giandomenico","raw_affiliation_strings":["Dipartimento di Inform\u00e1tica, Universit\u00e0 Di L'Aquila, Via Vetoio, 67010, Coppito (AQ), Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Inform\u00e1tica, Universit\u00e0 Di L'Aquila, Via Vetoio, 67010, Coppito (AQ), Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004954937","display_name":"Adam N. Letchford","orcid":"https://orcid.org/0000-0002-3191-5006"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Adam N. Letchford","raw_affiliation_strings":["Department of Management Science, Lancaster University, Lancaster LA1 4YX, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Management Science, Lancaster University, Lancaster LA1 4YX, United Kingdom","institution_ids":["https://openalex.org/I67415387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059118431","display_name":"Fabrizio Rossi","orcid":"https://orcid.org/0000-0002-7495-390X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fabrizio Rossi","raw_affiliation_strings":["Dipartimento di Inform\u00e1tica, Universit\u00e0 Di L'Aquila, Via Vetoio, 67010, Coppito (AQ), Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Inform\u00e1tica, Universit\u00e0 Di L'Aquila, Via Vetoio, 67010, Coppito (AQ), Italy","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043284276","display_name":"Stefano Smriglio","orcid":"https://orcid.org/0000-0001-8152-003X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefano Smriglio","raw_affiliation_strings":["Dipartimento di Inform\u00e1tica, Universit\u00e0 Di L'Aquila, Via Vetoio, 67010, Coppito (AQ), Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Inform\u00e1tica, Universit\u00e0 Di L'Aquila, Via Vetoio, 67010, Coppito (AQ), Italy","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021126920"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5117,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8185563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"3","first_page":"1944","last_page":"1963"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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.9940000176429749,"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.9700999855995178,"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/ellipsoid","display_name":"Ellipsoid","score":0.8603748679161072},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7759077548980713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7679334878921509},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6714202761650085},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5792723298072815},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.5360105037689209},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5081677436828613},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5044089555740356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48236292600631714},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47594690322875977},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4749833941459656},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.47388097643852234},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4644380211830139},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.42546722292900085},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.40573570132255554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38407665491104126},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.36731305718421936},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3527768850326538},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.2525213956832886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1404162049293518},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09769400954246521},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09155207872390747}],"concepts":[{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.8603748679161072},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7759077548980713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7679334878921509},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6714202761650085},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5792723298072815},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.5360105037689209},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5081677436828613},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5044089555740356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48236292600631714},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47594690322875977},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4749833941459656},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.47388097643852234},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4644380211830139},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.42546722292900085},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.40573570132255554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38407665491104126},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.36731305718421936},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3527768850326538},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2525213956832886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1404162049293518},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09769400954246521},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09155207872390747},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/140966332","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140966332","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"},{"id":"pmh:oai:eprints.lancs.ac.uk:74728","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.lancs.ac.uk/id/eprint/74728/1/ellipsoids_source.pdf","source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"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":"PeerReviewed"}],"best_oa_location":{"id":"pmh:oai:eprints.lancs.ac.uk:74728","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.lancs.ac.uk/id/eprint/74728/1/ellipsoids_source.pdf","source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"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":"PeerReviewed"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3421263000","display_name":null,"funder_award_id":"EP/D072662/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2158095962.pdf","grobid_xml":"https://content.openalex.org/works/W2158095962.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W96673193","https://openalex.org/W118111821","https://openalex.org/W1501644705","https://openalex.org/W1515168927","https://openalex.org/W1968143987","https://openalex.org/W1975442866","https://openalex.org/W1977688827","https://openalex.org/W2000920559","https://openalex.org/W2006934540","https://openalex.org/W2007218093","https://openalex.org/W2009923109","https://openalex.org/W2020562473","https://openalex.org/W2065141624","https://openalex.org/W2066554880","https://openalex.org/W2068262026","https://openalex.org/W2069808690","https://openalex.org/W2074300280","https://openalex.org/W2078289947","https://openalex.org/W2081254453","https://openalex.org/W2089914558","https://openalex.org/W2090669908","https://openalex.org/W2100553789","https://openalex.org/W2105235982","https://openalex.org/W2106264302","https://openalex.org/W2107395148","https://openalex.org/W2114189119","https://openalex.org/W2118807841","https://openalex.org/W2139740075","https://openalex.org/W2144606698","https://openalex.org/W2146361854","https://openalex.org/W2146669290","https://openalex.org/W2149454052","https://openalex.org/W2157693956","https://openalex.org/W2249755937","https://openalex.org/W2489268653","https://openalex.org/W2912475851","https://openalex.org/W3149604617","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4288640859","https://openalex.org/W2910483300","https://openalex.org/W3204036718","https://openalex.org/W2300145982","https://openalex.org/W2578380588","https://openalex.org/W2375652826","https://openalex.org/W2363904277","https://openalex.org/W2580512045","https://openalex.org/W981962503","https://openalex.org/W4388321731"],"abstract_inverted_index":{"A":[0],"new":[1],"exact":[2],"approach":[3],"to":[4,13,54,65],"the":[5,15,35,41,44,55,71,90,93],"stable":[6,36,72],"set":[7,37,73],"problem":[8],"is":[9,52],"presented,":[10],"which":[11,75,88],"attempts":[12],"avoid":[14],"pitfalls":[16],"of":[17,70,92],"existing":[18],"approaches":[19],"based":[20],"on":[21],"linear":[22],"and":[23,39],"semidefinite":[24],"programming.":[25],"The":[26],"method":[27],"begins":[28],"by":[29,48],"constructing":[30],"an":[31],"ellipsoid":[32,60],"that":[33,43],"contains":[34],"polytope":[38],"has":[40],"property":[42],"upper":[45],"bound":[46],"obtained":[47],"optimizing":[49],"over":[50],"it":[51],"equal":[53],"Lov\u00e1sz":[56],"theta":[57],"number.":[58],"This":[59],"can":[61,76],"then":[62],"be":[63,77],"used":[64],"construct":[66],"useful":[67],"convex":[68],"relaxations":[69],"problem,":[74],"embedded":[78],"within":[79],"a":[80],"branch-and-bound":[81],"framework.":[82],"Extensive":[83],"computational":[84],"results":[85],"are":[86],"given,":[87],"indicate":[89],"potential":[91],"approach.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}