{"id":"https://openalex.org/W4417071870","doi":"https://doi.org/10.1007/s12532-025-00298-8","title":"Application of the Lov\u00e1sz-Schrijver Operator to Compact Stable Set Integer Programs","display_name":"Application of the Lov\u00e1sz-Schrijver Operator to Compact Stable Set Integer Programs","publication_year":2025,"publication_date":"2025-12-06","ids":{"openalex":"https://openalex.org/W4417071870","doi":"https://doi.org/10.1007/s12532-025-00298-8"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-025-00298-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00298-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00298-8.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00298-8.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050050772","display_name":"Federico Battista","orcid":"https://orcid.org/0000-0002-7880-1540"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Federico Battista","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, 18015, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, 18015, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059118431","display_name":"Fabrizio Rossi","orcid":"https://orcid.org/0000-0002-7495-390X"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio Rossi","raw_affiliation_strings":["DISIM, University of L\u2019Aquila, 67100, Via Vetoio, Coppito (AQ), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DISIM, University of L\u2019Aquila, 67100, Via Vetoio, Coppito (AQ), Italy","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043284276","display_name":"Stefano Smriglio","orcid":"https://orcid.org/0000-0001-8152-003X"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Smriglio","raw_affiliation_strings":["DISIM, University of L\u2019Aquila, 67100, Via Vetoio, Coppito (AQ), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DISIM, University of L\u2019Aquila, 67100, Via Vetoio, Coppito (AQ), Italy","institution_ids":["https://openalex.org/I26415053"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050050772"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.45554446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"2","first_page":"443","last_page":"480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.597000002861023,"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.597000002861023,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.09470000118017197,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0925000011920929,"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/theory-of-computation","display_name":"Theory of computation","score":0.7669000029563904},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6478999853134155},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6445000171661377},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6111000180244446},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5285999774932861},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48899999260902405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42800000309944153},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4097999930381775},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.40290001034736633}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7669000029563904},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6478999853134155},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6445000171661377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6345999836921692},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6111000180244446},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5285999774932861},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5020999908447266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49380001425743103},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48899999260902405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42800000309944153},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4018000066280365},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3950999975204468},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3174000084400177},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26829999685287476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-025-00298-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00298-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00298-8.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s12532-025-00298-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00298-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00298-8.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417071870.pdf","grobid_xml":"https://content.openalex.org/works/W4417071870.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W51435562","https://openalex.org/W1501644705","https://openalex.org/W1632601927","https://openalex.org/W1803930816","https://openalex.org/W1967073510","https://openalex.org/W1971116373","https://openalex.org/W1977688827","https://openalex.org/W1986218927","https://openalex.org/W1986997293","https://openalex.org/W1988622494","https://openalex.org/W1996270513","https://openalex.org/W2000920559","https://openalex.org/W2006934540","https://openalex.org/W2007218093","https://openalex.org/W2015880537","https://openalex.org/W2037016941","https://openalex.org/W2046112356","https://openalex.org/W2046866204","https://openalex.org/W2051269964","https://openalex.org/W2059909742","https://openalex.org/W2061824611","https://openalex.org/W2061830070","https://openalex.org/W2065141624","https://openalex.org/W2065260707","https://openalex.org/W2066459185","https://openalex.org/W2066554880","https://openalex.org/W2068262026","https://openalex.org/W2068617151","https://openalex.org/W2069572432","https://openalex.org/W2078289947","https://openalex.org/W2079817983","https://openalex.org/W2082603400","https://openalex.org/W2090669908","https://openalex.org/W2091591084","https://openalex.org/W2100553789","https://openalex.org/W2106264302","https://openalex.org/W2114189119","https://openalex.org/W2139740075","https://openalex.org/W2142333440","https://openalex.org/W2144606698","https://openalex.org/W2157693956","https://openalex.org/W2158095962","https://openalex.org/W2166742555","https://openalex.org/W2167508847","https://openalex.org/W2277188586","https://openalex.org/W2416465474","https://openalex.org/W2497949436","https://openalex.org/W2607539118","https://openalex.org/W2613858437","https://openalex.org/W2913439212","https://openalex.org/W2963774730","https://openalex.org/W3032256346","https://openalex.org/W3035984753","https://openalex.org/W3174867595","https://openalex.org/W3188298178","https://openalex.org/W3191501345","https://openalex.org/W4221034559","https://openalex.org/W4300568640","https://openalex.org/W4320040605","https://openalex.org/W4399019256"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Lov\u00e1sz":[2,116],"theta":[3,84],"function":[4],"$$\\theta":[5,55,199,227],"(G)$$":[6,56,200,228],"<mml:math":[7,57,99,201,229],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[8,58,100,202,230],"<mml:mrow>":[9,59,101,106,203,231],"<mml:mi>\u03b8</mml:mi>":[10,60,204,232],"<mml:mo>(</mml:mo>":[11,61,107,205,233],"<mml:mi>G</mml:mi>":[12,62,206,234],"<mml:mo>)</mml:mo>":[13,63,109,207,235],"</mml:mrow>":[14,64,110,111,208,236],"</mml:math>":[15,65,112,209,237],"provides":[16],"a":[17,27,40,67,242],"very":[18],"good":[19],"upper":[20,223],"bound":[21,85,192],"on":[22,90,163,182,250,257],"the":[23,76,83,93,96,120,124,148,160,178,189,247,254],"stability":[24],"number":[25],"of":[26,75,95,115,123,150,159],"graph":[28],"G":[29],".":[30,210],"It":[31],"can":[32,238],"be":[33,49,239],"computed":[34],"in":[35,52],"polynomial":[36],"time":[37],"by":[38,174,241],"solving":[39,133],"semidefinite":[41],"program":[42],"(SDP),":[43],"which":[44],"also":[45],"turns":[46],"out":[47],"to":[48,81,119,154],"fairly":[50],"tractable":[51],"practice.":[53],"Consequently,":[54],"achieves":[66],"hard-to-beat":[68],"trade-off":[69],"between":[70],"computational":[71,212],"effort":[72,245],"and":[73,117,141,165,253],"strength":[74],"bound.":[77],"Indeed,":[78],"several":[79],"attempts":[80],"improve":[82],"are":[86,172],"documented,":[87,220],"mainly":[88],"based":[89,162,181],"playing":[91],"around":[92],"application":[94,149],"$$N_+(\\cdot":[97],")$$":[98],"<mml:msub>":[102],"<mml:mi>N</mml:mi>":[103],"<mml:mo>+</mml:mo>":[104],"</mml:msub>":[105],"<mml:mo>\u00b7</mml:mo>":[108],"lifting":[113],"operator":[114,153],"Schrijver":[118],"classical":[121],"formulation":[122,180,249],"maximum":[125],"stable":[126],"set":[127],"problem":[128],"(SSP).":[129],"Experience":[130],"shows":[131,221],"that":[132,188,222],"such":[134,151],"SDPs":[135],"often":[136],"struggles":[137],"against":[138],"practical":[139],"intractability":[140],"requires":[142],"highly":[143],"specialized":[144],"methods.":[145],"We":[146],"investigate":[147],"an":[152],"two":[155,170],"different":[156],"linear":[157],"formulations":[158,171],"SSP":[161],"clique":[164],"nodal":[166],"inequalities,":[167,184],"respectively.":[168],"These":[169],"described":[173],"fewer":[175],"inequalities":[176],"than":[177,217,226],"natural":[179],"edge":[183],"yet":[185],"they":[186],"guarantee":[187],"resulting":[190],"SDP":[191],"is":[193],"at":[194],"least":[195],"as":[196,198],"strong":[197],"Our":[211],"experience,":[213],"including":[214],"larger":[215],"graphs":[216,252],"those":[218],"previously":[219],"bounds":[224],"stronger":[225],"accessed":[240],"reasonable":[243],"additional":[244],"using":[246],"clique-based":[248],"sparse":[251],"nodal-based":[255],"one":[256],"dense":[258],"graphs.":[259]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-12-06T00:00:00"}