{"id":"https://openalex.org/W4387914285","doi":"https://doi.org/10.1109/codit58514.2023.10284215","title":"Unsplittable Shortest Path Routing: Extended Model and Matheuristic","display_name":"Unsplittable Shortest Path Routing: Extended Model and Matheuristic","publication_year":2023,"publication_date":"2023-07-03","ids":{"openalex":"https://openalex.org/W4387914285","doi":"https://doi.org/10.1109/codit58514.2023.10284215"},"language":"en","primary_location":{"id":"doi:10.1109/codit58514.2023.10284215","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit58514.2023.10284215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-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/A5108144750","display_name":"Amal Benhamiche","orcid":null},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Amal Benhamiche","raw_affiliation_strings":["Orange Labs,Châtillon,France,92320"],"affiliations":[{"raw_affiliation_string":"Orange Labs,Châtillon,France,92320","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089092295","display_name":"Morgan Chopin","orcid":"https://orcid.org/0000-0002-9668-1300"},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Morgan Chopin","raw_affiliation_strings":["Orange Labs,Châtillon,France,92320"],"affiliations":[{"raw_affiliation_string":"Orange Labs,Châtillon,France,92320","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083892488","display_name":"S\u00e9bastien Martin","orcid":"https://orcid.org/0000-0002-8528-6698"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Martin","raw_affiliation_strings":["Huawei Technologies & co.,Boulogne Billancourt,France"],"affiliations":[{"raw_affiliation_string":"Huawei Technologies & co.,Boulogne Billancourt,France","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108144750"],"corresponding_institution_ids":["https://openalex.org/I19370010"],"apc_list":null,"apc_paid":null,"fwci":1.0046,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77751407,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"926","last_page":"931"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6883612275123596},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6735473871231079},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6584256291389465},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5883016586303711},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5481305122375488},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5130702257156372},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4808279275894165},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4656124413013458},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.45537030696868896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45386362075805664},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4409915804862976},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43014174699783325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35975968837738037},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3584359884262085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32015693187713623},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2068156599998474},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11493843793869019}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6883612275123596},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6735473871231079},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6584256291389465},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5883016586303711},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5481305122375488},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5130702257156372},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4808279275894165},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4656124413013458},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.45537030696868896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45386362075805664},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4409915804862976},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43014174699783325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35975968837738037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3584359884262085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32015693187713623},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2068156599998474},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11493843793869019},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit58514.2023.10284215","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit58514.2023.10284215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1490806218","https://openalex.org/W1562069137","https://openalex.org/W1684039864","https://openalex.org/W1974257405","https://openalex.org/W1987520910","https://openalex.org/W1993229082","https://openalex.org/W2081979535","https://openalex.org/W2142899221","https://openalex.org/W2622723078","https://openalex.org/W2953980454","https://openalex.org/W3033414435","https://openalex.org/W3145789150","https://openalex.org/W3200686493","https://openalex.org/W4241826368","https://openalex.org/W4247255165","https://openalex.org/W4248604969","https://openalex.org/W4251801412","https://openalex.org/W4382318768","https://openalex.org/W6629116435","https://openalex.org/W6632157684","https://openalex.org/W6779193723"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W1618717300","https://openalex.org/W1997440971","https://openalex.org/W2064711473","https://openalex.org/W104942727","https://openalex.org/W1579931977","https://openalex.org/W1515277195","https://openalex.org/W1971025399"],"abstract_inverted_index":{"In":[0,68],"this":[1,69],"paper,":[2,70],"we":[3,71],"consider":[4],"the":[5,15,43,54,121,125],"Unsplittable":[6],"Shortest":[7],"Path":[8],"Routing":[9],"(USPR)":[10],"problem":[11,24],"which":[12],"arises":[13],"in":[14],"field":[16],"of":[17,33,39,97,106],"traffic":[18],"engineering":[19],"for":[20],"IP":[21],"networks.":[22],"This":[23],"consists,":[25],"given":[26],"a":[27,31,37,73,85,104],"bidirected":[28],"graph":[29],"and":[30,42,61],"set":[32,38,105],"commodities,":[34],"to":[35,65,95,112,120],"compute":[36],"routing":[40,79],"paths":[41],"associated":[44],"link":[45],"weights":[46],"such":[47],"that":[48,81,108],"each":[49],"commodity":[50],"is":[51,82],"routed":[52],"along":[53],"unique":[55],"shortest":[56],"path":[57],"between":[58],"its":[59,62],"origin":[60],"destination,":[63],"according":[64],"these":[66],"weights.":[67],"propose":[72],"novel":[74],"extended":[75],"formulation":[76],"based":[77],"on":[78],"variables":[80],"solved":[83],"using":[84],"column":[86],"generation":[87],"procedure,":[88],"further":[89],"enriched":[90],"by":[91,124],"primal":[92],"heuristics":[93],"allowing":[94],"build":[96],"an":[98],"efficient":[99],"matheuristic.":[100],"We":[101],"show":[102],"through":[103],"experiments":[107],"our":[109],"algorithm":[110],"allows":[111],"quickly":[113],"identify":[114],"good":[115],"feasible":[116],"solutions":[117],"when":[118],"compared":[119],"results":[122],"obtained":[123],"state-of-the-art":[126],"local":[127],"search":[128],"algorithm.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}