{"id":"https://openalex.org/W2157693956","doi":"https://doi.org/10.1016/s0167-6377(00)00060-2","title":"A branch-and-cut algorithm for the maximum cardinality stable set problem","display_name":"A branch-and-cut algorithm for the maximum cardinality stable set problem","publication_year":2001,"publication_date":"2001-03-01","ids":{"openalex":"https://openalex.org/W2157693956","doi":"https://doi.org/10.1016/s0167-6377(00)00060-2","mag":"2157693956"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(00)00060-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(00)00060-2","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/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":true,"raw_author_name":"F Rossi","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, Via Vetoio, 67010 Coppito (L'Aquila), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, Via Vetoio, 67010 Coppito (L'Aquila), 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":"S Smriglio","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, Via Vetoio, 67010 Coppito (L'Aquila), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, Via Vetoio, 67010 Coppito (L'Aquila), Italy","institution_ids":["https://openalex.org/I26415053"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059118431"],"corresponding_institution_ids":["https://openalex.org/I26415053"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":1.3638,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.82384541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"2","first_page":"63","last_page":"74"},"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.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/maximum-cut","display_name":"Maximum cut","score":0.7325096130371094},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6369842290878296},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6241369247436523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6143115162849426},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5511236190795898},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5149691700935364},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5079153180122375},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.48935097455978394},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4405183792114258},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4246305227279663},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42401832342147827},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42241179943084717},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40540528297424316},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36221015453338623},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.36170995235443115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3094855546951294},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.12595659494400024},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10573825240135193}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7325096130371094},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6369842290878296},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6241369247436523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6143115162849426},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5511236190795898},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5149691700935364},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5079153180122375},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.48935097455978394},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4405183792114258},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4246305227279663},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42401832342147827},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42241179943084717},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40540528297424316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36221015453338623},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.36170995235443115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3094855546951294},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.12595659494400024},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10573825240135193},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0167-6377(00)00060-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(00)00060-2","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:bibcyt.ucla.edu.ve:T070300010710/2","is_oa":false,"landing_page_url":"http://bibcyt.ucla.edu.ve/cgi-win/be_alex.exe?Acceso=T070300010710/2&Nombrebd=Bciucla","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1969703328","https://openalex.org/W2001341021","https://openalex.org/W2011039300","https://openalex.org/W2011191524","https://openalex.org/W2015880537","https://openalex.org/W2027996040","https://openalex.org/W2041754841","https://openalex.org/W2043005464","https://openalex.org/W2050597756","https://openalex.org/W2065141624","https://openalex.org/W2066554880","https://openalex.org/W2091591084","https://openalex.org/W2100440346","https://openalex.org/W2145570573","https://openalex.org/W2170021258","https://openalex.org/W2401303991","https://openalex.org/W2578759464","https://openalex.org/W4236680666","https://openalex.org/W4249723552","https://openalex.org/W4285719527","https://openalex.org/W6713215279"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W3037291746","https://openalex.org/W3004945501","https://openalex.org/W3164644441","https://openalex.org/W2561239406","https://openalex.org/W1760432569","https://openalex.org/W2788922840","https://openalex.org/W1856729396","https://openalex.org/W2907170473","https://openalex.org/W4380486534"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}