{"id":"https://openalex.org/W1576264942","doi":"https://doi.org/10.1109/icton.2015.7193456","title":"Constrained shortest path problems: state-of-the-art and recent advances","display_name":"Constrained shortest path problems: state-of-the-art and recent advances","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W1576264942","doi":"https://doi.org/10.1109/icton.2015.7193456","mag":"1576264942"},"language":"en","primary_location":{"id":"doi:10.1109/icton.2015.7193456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icton.2015.7193456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 17th 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/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. Festa","raw_affiliation_strings":["Department of Mathematics and Applications, University of Napoli Federico II, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, University of Napoli Federico II, Italy","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090584718"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5621,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77667471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8213825225830078},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.7991280555725098},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.644541323184967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6291422247886658},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6253795623779297},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6237120032310486},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5190683007240295},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49559009075164795},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4212293326854706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23436284065246582},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1654529571533203},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1561821699142456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1192154586315155},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10701605677604675}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8213825225830078},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.7991280555725098},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.644541323184967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6291422247886658},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6253795623779297},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6237120032310486},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5190683007240295},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49559009075164795},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4212293326854706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23436284065246582},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1654529571533203},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1561821699142456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1192154586315155},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10701605677604675},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icton.2015.7193456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icton.2015.7193456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 17th International Conference on Transparent Optical Networks (ICTON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W187359699","https://openalex.org/W197883060","https://openalex.org/W311217234","https://openalex.org/W1537221987","https://openalex.org/W1543377438","https://openalex.org/W1556547111","https://openalex.org/W1583205259","https://openalex.org/W1871367359","https://openalex.org/W1964443412","https://openalex.org/W1973745435","https://openalex.org/W1977545325","https://openalex.org/W2003066927","https://openalex.org/W2005199432","https://openalex.org/W2011039300","https://openalex.org/W2011282943","https://openalex.org/W2036900823","https://openalex.org/W2038806981","https://openalex.org/W2056802293","https://openalex.org/W2058479406","https://openalex.org/W2058845836","https://openalex.org/W2061632451","https://openalex.org/W2061701207","https://openalex.org/W2062365082","https://openalex.org/W2063317962","https://openalex.org/W2069916913","https://openalex.org/W2074117023","https://openalex.org/W2078948975","https://openalex.org/W2085041447","https://openalex.org/W2093952957","https://openalex.org/W2096171214","https://openalex.org/W2098074159","https://openalex.org/W2098432798","https://openalex.org/W2100130852","https://openalex.org/W2115760878","https://openalex.org/W2130626677","https://openalex.org/W2130679277","https://openalex.org/W2131058166","https://openalex.org/W2131559541","https://openalex.org/W2137773606","https://openalex.org/W2139148132","https://openalex.org/W2151861549","https://openalex.org/W2153937695","https://openalex.org/W2154355266","https://openalex.org/W2159637648","https://openalex.org/W2168347717","https://openalex.org/W2169528473","https://openalex.org/W2170833051","https://openalex.org/W2305373430","https://openalex.org/W2341171179","https://openalex.org/W2408262133","https://openalex.org/W3137299218","https://openalex.org/W4213060235","https://openalex.org/W4285719527","https://openalex.org/W6607619971","https://openalex.org/W6608100698","https://openalex.org/W6610072603","https://openalex.org/W6674995601","https://openalex.org/W6677555952","https://openalex.org/W6682908328","https://openalex.org/W6704298589","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2388410942","https://openalex.org/W2009987517","https://openalex.org/W2040572217","https://openalex.org/W2375775343","https://openalex.org/W2365712669","https://openalex.org/W2198982833","https://openalex.org/W191849398","https://openalex.org/W2112429204"],"abstract_inverted_index":{"Constrained":[0],"shortest":[1,6,81,114],"path":[2,7,15,36,82,115],"problems":[3,8,83,116],"are":[4,21,143],"special":[5,118],"with":[9,117],"additional":[10,26],"constraints":[11,27],"imposed":[12],"on":[13],"a":[14,45,53,63,108],"to":[16,40,43,51,59,77,102,111,120],"be":[17,30,38],"considered":[18],"feasible.":[19],"There":[20],"many":[22,86],"possible":[23],"variants":[24],"of":[25,48,56,67],"that":[28,79],"can":[29,37],"imposed.":[31],"For":[32],"example,":[33],"the":[34,71,121,125],"solution":[35,141],"constrained":[39,80,113,123],"cross":[41,52],"or":[42],"avoid":[44],"given":[46,54,64],"subset":[47],"nodes":[49,57,61],"and/or":[50,58],"number":[55],"involve":[60],"within":[62],"covering":[65],"distance":[66],"every":[68],"node":[69],"in":[70,85,99],"network,":[72],"and":[73,97,134],"so":[74],"on.":[75],"Useless":[76],"say":[78],"arise":[84],"real-life":[87],"applications,":[88],"ranging":[89],"from":[90],"railroad":[91],"management,":[92],"military":[93],"aircraft":[94],"management":[95],"systems,":[96],"routing":[98],"road":[100],"networks":[101],"scheduling":[103],"problems.":[104],"This":[105],"paper":[106],"presents":[107],"brief":[109],"introduction":[110],"some":[112],"attention":[119],"resource":[122],"version,":[124],"most":[126,139],"studied":[127],"variant.":[128],"The":[129,138],"problem":[130],"is":[131],"mathematically":[132],"formulated":[133],"its":[135],"properties":[136],"analyzed.":[137],"popular":[140],"techniques":[142],"surveyed.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}