{"id":"https://openalex.org/W3087965858","doi":"https://doi.org/10.1109/icton51198.2020.9203378","title":"On the Shortest Path Problems with Edge Constraints","display_name":"On the Shortest Path Problems with Edge Constraints","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3087965858","doi":"https://doi.org/10.1109/icton51198.2020.9203378","mag":"3087965858"},"language":"en","primary_location":{"id":"doi:10.1109/icton51198.2020.9203378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icton51198.2020.9203378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 22nd International Conference on Transparent Optical Networks (ICTON)","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/A5038612874","display_name":"Daniele Ferone","orcid":"https://orcid.org/0000-0003-4696-7826"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Daniele Ferone","raw_affiliation_strings":["University of Calabria, Rende, Italy"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paola Festa","raw_affiliation_strings":["University of Naples \u201cFederico II\u201d, Naples, Italy","University of Naples \"Federico II\", Naples, Italy"],"affiliations":[{"raw_affiliation_string":"University of Naples \u201cFederico II\u201d, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"University of Naples \"Federico II\", Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028431272","display_name":"Serena Fugaro","orcid":"https://orcid.org/0000-0002-7140-3531"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Serena Fugaro","raw_affiliation_strings":["University of Naples \u201cFederico II\u201d, Naples, Italy","University of Naples \"Federico II\", Naples, Italy"],"affiliations":[{"raw_affiliation_string":"University of Naples \u201cFederico II\u201d, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"University of Naples \"Federico II\", Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042516759","display_name":"Tommaso Pastore","orcid":"https://orcid.org/0000-0002-4121-5003"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Tommaso Pastore","raw_affiliation_strings":["University of Naples \u201cFederico II\u201d, Naples, Italy","University of Naples \"Federico II\", Naples, Italy"],"affiliations":[{"raw_affiliation_string":"University of Naples \u201cFederico II\u201d, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"University of Naples \"Federico II\", Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038612874"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.5595,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66440077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"18","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9882000088691711,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9648000001907349,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.716162919998169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5839473009109497},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5817709565162659},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5747801065444946},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5231748223304749},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.521757185459137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5196322798728943},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.501704216003418},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4356461763381958},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4284496307373047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4141542613506317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4028233289718628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3561754524707794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3391822278499603},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33280786871910095},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.3143653869628906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28210365772247314},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1803598701953888},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16563671827316284},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05899924039840698}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.716162919998169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5839473009109497},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5817709565162659},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5747801065444946},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5231748223304749},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.521757185459137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5196322798728943},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.501704216003418},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4356461763381958},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4284496307373047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4141542613506317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4028233289718628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3561754524707794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3391822278499603},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33280786871910095},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3143653869628906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28210365772247314},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1803598701953888},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16563671827316284},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05899924039840698},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icton51198.2020.9203378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icton51198.2020.9203378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 22nd International Conference on Transparent Optical Networks (ICTON)","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":20,"referenced_works":["https://openalex.org/W606997861","https://openalex.org/W1981162332","https://openalex.org/W1995415305","https://openalex.org/W1995747983","https://openalex.org/W1998132631","https://openalex.org/W1998235168","https://openalex.org/W2011824721","https://openalex.org/W2029341065","https://openalex.org/W2053060257","https://openalex.org/W2056455157","https://openalex.org/W2069667928","https://openalex.org/W2076023255","https://openalex.org/W2106784610","https://openalex.org/W2156312014","https://openalex.org/W2594963174","https://openalex.org/W2766862316","https://openalex.org/W2898326944","https://openalex.org/W2985298301","https://openalex.org/W3002125472","https://openalex.org/W6650021571"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2018146256","https://openalex.org/W2237480599","https://openalex.org/W4299588719","https://openalex.org/W2020255949","https://openalex.org/W2375775343","https://openalex.org/W1817899449","https://openalex.org/W4382866750","https://openalex.org/W2600678155","https://openalex.org/W3184816460"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,11,37,44,73,96,133,141,192,205,223,231],"this":[3],"work":[4],"is":[5,47,76,81,103,107,151,159,200,226],"to":[6,60,83,89,127,161,174,202,213],"provide":[7],"a":[8,70,100,157,169,175,195,218],"brief":[9],"classification":[10],"some":[12],"Shortest":[13,52],"Path":[14,53],"Problem":[15],"(SPP)":[16],"variants":[17,122],"that":[18,23,87],"include":[19],"edge":[20,163],"constraints":[21],"and":[22,34,41,67,113,164,209],"find":[24],"applications":[25,145],"in":[26,58,93,146,217],"several":[27],"different":[28],"contexts,":[29],"including":[30],"optical":[31],"networks,":[32],"transportation":[33],"logistics.":[35],"One":[36],"the":[38,61,94,97,110,115,119,128,131,134,152,165,190,211],"most":[39],"broad":[40],"notable":[42],"classes":[43],"edge-constrained":[45],"SPPs":[46],"given":[48,170],"by":[49],"Resource":[50],"Constrained":[51],"Problems":[54],"(RCSPPs).":[55],"In":[56],"RCSPPs,":[57],"addition":[59],"customary":[62],"directed":[63],"graph":[64,135],"G=(V,":[65],"A)":[66],"edge-distance":[68],"function,":[69,112],"L-dimensional":[71],"vector":[72],"resources":[74,120],"R":[75],"defined.":[77],"Essentially,":[78],"each":[79,162,203],"resource":[80],"related":[82],"relevant":[84,144],"link":[85],"attributes":[86],"need":[88],"be":[90,214],"accounted":[91],"for":[92,189],"planning":[95],"path.":[98],"Accordingly,":[99],"path":[101,167,219],"P*":[102],"optimal":[104],"whenever":[105],"it":[106],"minimal":[108],"w.r.t.":[109],"distance":[111],"satisfies":[114],"restrictions":[116],"enforced":[117],"on":[118],"Other":[121],"can":[123],"involve":[124],"colors":[125,206],"assigned":[126,160,201],"nodes":[129],"and/or":[130,136],"edges":[132],"reload":[137,193,196],"costs.":[138],"These":[139],"kinds":[140],"problems":[142],"have":[143],"network":[147],"reliability.":[148],"Particularly":[149],"interesting":[150],"so-called":[153],"k-Color":[154],"SPP,":[155],"where":[156],"color":[158,224,232],"minimum":[166],"from":[168],"source":[171],"node":[172,177],"s":[173],"target":[176],"t":[178],"must":[179],"not":[180],"cross":[181],"more":[182],"than":[183],"k":[184],"differently":[185],"colored":[186],"edges.":[187],"As":[188],"use":[191],"cost,":[194],"cost":[197],"r(b,":[198],"c)":[199,208],"pair":[204],"(b,":[207],"represents":[210],"amount":[212],"paid":[215],"if":[216],"P":[220],"an":[221,229],"arc":[222,230],"c":[225],"traversed":[227],"after":[228],"b.":[233]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}