{"id":"https://openalex.org/W3106189041","doi":"https://doi.org/10.1007/s11590-020-01659-z","title":"A dynamic programming algorithm for solving the k-Color Shortest Path Problem","display_name":"A dynamic programming algorithm for solving the k-Color Shortest Path Problem","publication_year":2020,"publication_date":"2020-11-07","ids":{"openalex":"https://openalex.org/W3106189041","doi":"https://doi.org/10.1007/s11590-020-01659-z","mag":"3106189041"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-020-01659-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-020-01659-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/s11590-020-01659-z.pdf","any_repository_has_fulltext":true},"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":["Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Energy and Management Engineering, 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":["Department of Mathematics and Applications, University of Naples \u201cFederico II\u201d, Naples, Italy","Department of Mathematics and Applications, University of Naples \"Federico II\", Naples, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, University of Naples \u201cFederico II\u201d, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"Department of Mathematics and Applications, 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":["Department of Mathematics and Applications, University of Naples \u201cFederico II\u201d, Naples, Italy","Department of Mathematics and Applications, University of Naples \"Federico II\", Naples, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, University of Naples \u201cFederico II\u201d, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"Department of Mathematics and Applications, 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":["Department of Structures for Engineering and Architecture, University of Naples \u201cFederico II\u201d, Naples, Italy","Department of Structures for Engineering and Architecture, University of Naples \"Federico II\", Naples, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Structures for Engineering and Architecture, University of Naples \u201cFederico II\u201d, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"Department of Structures for Engineering and Architecture, 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":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.8021,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.87878499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"6","first_page":"1973","last_page":"1992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9929999709129333,"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.9929999709129333,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9815999865531921,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8133924603462219},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7091085910797119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6185624003410339},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5882226228713989},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5624834895133972},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.447520911693573},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4450249671936035},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41212135553359985},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3553365468978882},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27861684560775757},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2589442729949951},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24823972582817078}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8133924603462219},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7091085910797119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6185624003410339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5882226228713989},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5624834895133972},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.447520911693573},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4450249671936035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41212135553359985},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3553365468978882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27861684560775757},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2589442729949951},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24823972582817078},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11590-020-01659-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-020-01659-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:zenodo.org:81185","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/81185","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s11590-020-01659-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-020-01659-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324136","display_name":"Universit\u00e0 della Calabria","ror":"https://ror.org/02rc97e94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3106189041.pdf","grobid_xml":"https://content.openalex.org/works/W3106189041.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1822044859","https://openalex.org/W1969483458","https://openalex.org/W1995415305","https://openalex.org/W2099391941","https://openalex.org/W2166739719","https://openalex.org/W2572760112","https://openalex.org/W2595601445","https://openalex.org/W2887907926","https://openalex.org/W2896014154","https://openalex.org/W2914433252","https://openalex.org/W2971760385","https://openalex.org/W3002125472","https://openalex.org/W4237904615","https://openalex.org/W4394421676"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2349797546","https://openalex.org/W2161960576","https://openalex.org/W2366342492"],"abstract_inverted_index":{"Abstract":[0],"Several":[1],"variants":[2],"of":[3,19,39,55,68,108],"the":[4,14,20,24,37,53,56,66,99,106,109,120,125],"classical":[5],"Constrained":[6],"Shortest":[7,26],"Path":[8,27],"Problem":[9,28],"have":[10],"been":[11],"presented":[12],"in":[13,36,101,119],"literature":[15],"so":[16],"far.":[17],"One":[18],"most":[21],"recent":[22],"is":[23,45],"k-Color":[25],"(":[29],"$$k$$":[30],"<mml:math":[31],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mi>k</mml:mi></mml:math>":[32],"-CSPP),":[33],"that":[34],"arises":[35],"field":[38],"transmission":[40],"networks":[41],"design.":[42],"The":[43,116],"problem":[44],"formulated":[46],"on":[47],"a":[48,80,92],"weighted":[49],"edge-colored":[50],"graph":[51],"and":[52,84,94,105],"use":[54],"colors":[57],"as":[58],"edge":[59],"labels":[60],"allows":[61],"to":[62],"take":[63],"into":[64],"account":[65],"matter":[67],"path":[69],"reliability":[70],"while":[71],"optimizing":[72],"its":[73,86],"cost.":[74],"In":[75],"this":[76],"work,":[77],"we":[78],"propose":[79],"dynamic":[81,126],"programming":[82,127],"algorithm":[83,128],"compare":[85],"performances":[87],"with":[88,113],"two":[89],"solution":[90,107],"approaches:":[91],"Branch":[93],"Bound":[95],"technique":[96],"proposed":[97],"by":[98],"authors":[100],"their":[102],"previous":[103,131],"paper":[104],"mathematical":[110],"model":[111],"obtained":[112],"CPLEX":[114],"solver.":[115],"results":[117],"gathered":[118],"numerical":[121],"validation":[122],"evidenced":[123],"how":[124],"vastly":[129],"outperformed":[130],"approaches.":[132]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2020-11-23T00:00:00"}