{"id":"https://openalex.org/W4293018177","doi":"https://doi.org/10.1051/ro/2022146","title":"The edge-labeled survivable network design problem: Formulations and branch-and-cut","display_name":"The edge-labeled survivable network design problem: Formulations and branch-and-cut","publication_year":2022,"publication_date":"2022-08-25","ids":{"openalex":"https://openalex.org/W4293018177","doi":"https://doi.org/10.1051/ro/2022146"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2022146","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2022146","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2022/05/ro220042.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2022/05/ro220042.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110757530","display_name":"M. Ben Salem","orcid":null},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Mariem Ben Salem","raw_affiliation_strings":["FSEGS/MIRACL, Universit\u00e9 de Sfax, Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FSEGS/MIRACL, Universit\u00e9 de Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054801518","display_name":"Raouia Taktak","orcid":"https://orcid.org/0000-0003-2377-5709"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Raouia Taktak","raw_affiliation_strings":["ISIMS & Sma@rts/CRNS, Universit\u00e9 de Sfax, Sfax, Tunisia"],"raw_orcid":"https://orcid.org/0000-0003-2377-5709","affiliations":[{"raw_affiliation_string":"ISIMS & Sma@rts/CRNS, Universit\u00e9 de Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025163018","display_name":"Fatmah Almathkour","orcid":"https://orcid.org/0000-0002-6815-3949"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Fatmah Almathkour","raw_affiliation_strings":["Department of Statistics and Operations Research, Kuwait University, Kuwait City, Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, Kuwait University, Kuwait City, Kuwait","institution_ids":["https://openalex.org/I36721946"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2601,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60569579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"56","issue":"5","first_page":"3393","last_page":"3404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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.9939000010490417,"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/integer-programming","display_name":"Integer programming","score":0.7259746789932251},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.715638279914856},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5997486710548401},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5271275639533997},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5169031620025635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4959007203578949},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4871508777141571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4841823875904083},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.459644079208374},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4418555200099945},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.44083431363105774},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11181458830833435}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7259746789932251},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.715638279914856},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5997486710548401},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5271275639533997},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5169031620025635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4959007203578949},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4871508777141571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4841823875904083},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.459644079208374},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4418555200099945},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.44083431363105774},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11181458830833435},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2022146","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2022146","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2022/05/ro220042.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:edpsciences.org:dkey/10.1051/ro/2022146","is_oa":false,"landing_page_url":"https://www.rairo-ro.org/10.1051/ro/2022146/pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400744","display_name":"Springer Link (Chiba Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8488066","host_organization_name":"Chiba Institute of Technology","host_organization_lineage":["https://openalex.org/I8488066"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.1051/ro/2022146","raw_type":"Text"},{"id":"pmh:oai:numdam.org:RO_2022__56_5_3393_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2022146/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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"}],"best_oa_location":{"id":"doi:10.1051/ro/2022146","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2022146","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2022/05/ro220042.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4293018177.pdf","grobid_xml":"https://content.openalex.org/works/W4293018177.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W31709568","https://openalex.org/W131006777","https://openalex.org/W164111053","https://openalex.org/W201114412","https://openalex.org/W212203016","https://openalex.org/W1975457241","https://openalex.org/W1986207529","https://openalex.org/W2048177396","https://openalex.org/W2050771261","https://openalex.org/W2050851587","https://openalex.org/W2051100691","https://openalex.org/W2056058917","https://openalex.org/W2089581733","https://openalex.org/W2089731376","https://openalex.org/W2090359754","https://openalex.org/W2103384600","https://openalex.org/W2115049345","https://openalex.org/W2139317321","https://openalex.org/W2497096145","https://openalex.org/W2516171751","https://openalex.org/W2604916921","https://openalex.org/W2806976001","https://openalex.org/W2895324310","https://openalex.org/W2964140139","https://openalex.org/W2995111066","https://openalex.org/W3164348708","https://openalex.org/W4211176206","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3126345618","https://openalex.org/W2088744863","https://openalex.org/W1966891017","https://openalex.org/W2894175156","https://openalex.org/W4310698078","https://openalex.org/W1509031531","https://openalex.org/W2023242492","https://openalex.org/W2481372743","https://openalex.org/W2907872375","https://openalex.org/W2053527396"],"abstract_inverted_index":{"In":[0,26],"this":[1],"paper,":[2],"we":[3,28],"study":[4],"a":[5,48,60,70,78,94,103],"variant":[6],"of":[7,62,75,81,121],"the":[8,15,24,30,65,92,100,129,133,137,141,145,159,163],"survivable":[9,16],"network":[10,17],"design":[11,18],"problem,":[12,93],"that":[13,39,54,128],"is":[14,58,148],"problem":[19],"with":[20,55,77],"labels":[21,63],"(colors)":[22],"on":[23,99,119],"edges.":[25],"particular,":[27],"address":[29],"Generalized":[31],"Labeled":[32],"Two":[33],"Edge":[34],"Connected":[35],"Subgraph":[36],"Problem":[37],"(GLTECSP)":[38],"has":[40],"many":[41],"applications":[42],"in":[43,68],"telecommunication":[44],"and":[45,102,116,140],"transportation.":[46],"Given":[47],"connected":[49,72],"undirected":[50],"graph":[51],"G":[52,76],"such":[53],"each":[56],"edge":[57],"associated":[59],"set":[61],"(colors),":[64],"GLTECSP":[66],"consists":[67],"finding":[69],"two-edge":[71],"spanning":[73],"subgraph":[74],"minimum":[79],"number":[80],"distinct":[82],"labels.":[83],"We":[84,108],"propose":[85],"two":[86],"Integer":[87],"Programming":[88],"(IP)":[89],"formulations":[90,115],"for":[91],"natural":[95,134,164],"formulation":[96,105,131,147],"using":[97,106],"cuts":[98],"edges,":[101],"compact":[104,130,146],"color-cuts.":[107],"devise":[109],"Branch-and-Cut":[110],"algorithms":[111],"to":[112,150,152],"solve":[113,151],"both":[114],"compare":[117],"them":[118],"sets":[120],"randomly":[122],"generated":[123],"instances.":[124],"Computational":[125],"results":[126],"show":[127],"outperforms":[132],"one":[135],"regarding":[136],"linear":[138],"relaxation":[139],"computational":[142],"time.":[143],"Moreover,":[144],"able":[149],"optimality":[153],"several":[154],"instances":[155],"left":[156],"unsolved":[157],"within":[158],"time":[160],"limit":[161],"by":[162],"formulation.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2025-10-10T00:00:00"}