{"id":"https://openalex.org/W7124728091","doi":"https://doi.org/10.1002/net.70026","title":"An Exact Method for Reliable Shortest Path Problems With Correlation","display_name":"An Exact Method for Reliable Shortest Path Problems With Correlation","publication_year":2026,"publication_date":"2026-01-18","ids":{"openalex":"https://openalex.org/W7124728091","doi":"https://doi.org/10.1002/net.70026"},"language":"en","primary_location":{"id":"doi:10.1002/net.70026","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70026","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1002/net.70026","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123310658","display_name":"Esteban Leiva","orcid":null},"institutions":[{"id":"https://openalex.org/I162096671","display_name":"Universidad de Los Andes","ror":"https://ror.org/02mhbdp94","country_code":"CO","type":"education","lineage":["https://openalex.org/I162096671"]},{"id":"https://openalex.org/I4210143738","display_name":"Universidad de Los Andes","ror":"https://ror.org/04pqpvr75","country_code":"BO","type":"education","lineage":["https://openalex.org/I4210143738"]}],"countries":["BO","CO"],"is_corresponding":true,"raw_author_name":"Esteban Leiva","raw_affiliation_strings":["Centro para la Optimizaci\u00f3n y Probabilidad Aplicada (COPA), Departamento de Ingenier\u00eda Industrial Universidad de los Andes  Bogot\u00e1 Colombia","Departamento de Matem\u00e1ticas Universidad de los Andes  Bogot\u00e1 Colombia"],"raw_orcid":"https://orcid.org/0009-0004-8006-1301","affiliations":[{"raw_affiliation_string":"Centro para la Optimizaci\u00f3n y Probabilidad Aplicada (COPA), Departamento de Ingenier\u00eda Industrial Universidad de los Andes  Bogot\u00e1 Colombia","institution_ids":["https://openalex.org/I162096671"]},{"raw_affiliation_string":"Departamento de Matem\u00e1ticas Universidad de los Andes  Bogot\u00e1 Colombia","institution_ids":["https://openalex.org/I162096671","https://openalex.org/I4210143738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123347027","display_name":"Santiago Morales","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santiago Morales","raw_affiliation_strings":["Department of Mathematics University of California  Davis California USA"],"raw_orcid":"https://orcid.org/0009-0008-7937-318X","affiliations":[{"raw_affiliation_string":"Department of Mathematics University of California  Davis California USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067713108","display_name":"Daniel Yam\u00edn","orcid":"https://orcid.org/0000-0001-8770-2379"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Yam\u00edn","raw_affiliation_strings":["Tepper School of Business Carnegie Mellon University  Pittsburgh Pennsylvania USA"],"raw_orcid":"https://orcid.org/0000-0001-8770-2379","affiliations":[{"raw_affiliation_string":"Tepper School of Business Carnegie Mellon University  Pittsburgh Pennsylvania USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029621760","display_name":"Andr\u00e9s L. Medaglia","orcid":"https://orcid.org/0000-0003-1529-0322"},"institutions":[{"id":"https://openalex.org/I162096671","display_name":"Universidad de Los Andes","ror":"https://ror.org/02mhbdp94","country_code":"CO","type":"education","lineage":["https://openalex.org/I162096671"]}],"countries":["CO"],"is_corresponding":false,"raw_author_name":"Andr\u00e9s L. Medaglia","raw_affiliation_strings":["Centro para la Optimizaci\u00f3n y Probabilidad Aplicada (COPA), Departamento de Ingenier\u00eda Industrial Universidad de los Andes  Bogot\u00e1 Colombia"],"raw_orcid":"https://orcid.org/0000-0003-1529-0322","affiliations":[{"raw_affiliation_string":"Centro para la Optimizaci\u00f3n y Probabilidad Aplicada (COPA), Departamento de Ingenier\u00eda Industrial Universidad de los Andes  Bogot\u00e1 Colombia","institution_ids":["https://openalex.org/I162096671"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5123310658"],"corresponding_institution_ids":["https://openalex.org/I162096671","https://openalex.org/I4210143738"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":{"value":3400,"currency":"USD","value_usd":3400},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10933859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"4","first_page":"372","last_page":"389"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.29319998621940613,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.29319998621940613,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.2842000126838684,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.15330000221729279,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.7874000072479248},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6894000172615051},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6685000061988831},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5982999801635742},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5903000235557556},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5309000015258789},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4821999967098236},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.46619999408721924}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7874000072479248},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6894000172615051},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6685000061988831},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6202999949455261},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5982999801635742},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5903000235557556},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5309000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5175999999046326},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4821999967098236},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.46619999408721924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45579999685287476},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.44359999895095825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.397599995136261},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.38179999589920044},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.35670000314712524},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.2599000036716461},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.2590000033378601}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.70026","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70026","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/net.70026","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70026","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W117225691","https://openalex.org/W1859963747","https://openalex.org/W1979729479","https://openalex.org/W1997822129","https://openalex.org/W2007659532","https://openalex.org/W2010760359","https://openalex.org/W2013734727","https://openalex.org/W2023616065","https://openalex.org/W2032429181","https://openalex.org/W2046236705","https://openalex.org/W2062568266","https://openalex.org/W2064310122","https://openalex.org/W2069667928","https://openalex.org/W2074675836","https://openalex.org/W2091253199","https://openalex.org/W2106784610","https://openalex.org/W2120575449","https://openalex.org/W2145638978","https://openalex.org/W2147065425","https://openalex.org/W2168482679","https://openalex.org/W2518921919","https://openalex.org/W2520097342","https://openalex.org/W2615600520","https://openalex.org/W2765786618","https://openalex.org/W2800070170","https://openalex.org/W2803638397","https://openalex.org/W2908598977","https://openalex.org/W2980134951","https://openalex.org/W2999148895","https://openalex.org/W3036399211","https://openalex.org/W3124277730","https://openalex.org/W3135462388","https://openalex.org/W4200031930","https://openalex.org/W4366957285","https://openalex.org/W4391654320","https://openalex.org/W4403613126"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"Shortest":[1],"path":[2,38,87,101,111],"problems":[3,39],"often":[4,19],"arise":[5],"in":[6],"contexts":[7],"where":[8],"travel":[9,27,43,58,112],"times":[10,59,113],"are":[11,18],"uncertain.":[12],"In":[13],"these":[14],"settings,":[15],"reliable":[16,36],"paths":[17,23],"valued":[20],"more":[21],"than":[22],"with":[24,55],"lower":[25],"expected":[26],"times.":[28],"This":[29],"has":[30],"led":[31],"to":[32,141,168],"several":[33],"variants":[34,80],"of":[35,68,81,92,110,125],"shortest":[37,86,99],"(RSPP)":[40],"that":[41,150],"handle":[42],"time":[44],"reliability":[45,109],"differently.":[46],"We":[47,103],"propose":[48],"an":[49],"algorithmic":[50,76],"framework":[51,77,152],"for":[52],"solving":[53],"RSPPs":[54],"non\u2010negatively":[56],"correlated":[57],"and":[60,74,97,114,121,129,145,166],"resource":[61],"constraints.":[62],"By":[63],"building":[64],"upon":[65],"the":[66,69,82,84,89,98,108,126,151],"flexibility":[67],"pulse":[70],"algorithm,":[71],"our":[72],"unified":[73],"exact":[75],"solves":[78],"multiple":[79],"RSPP:":[83],"\u2010reliable":[85,100],"(\u2010RSP),":[88],"maximum":[90],"probability":[91],"on\u2010time":[93],"arrival":[94],"(MPOAP)":[95],"problem,":[96],"(S\u2010).":[102],"derive":[104],"a":[105,154],"bound":[106],"on":[107,135],"incorporate":[115],"three":[116],"pruning":[117],"strategies:":[118],"bounds,":[119],"infeasibility,":[120],"dominance,":[122],"leveraging":[123],"properties":[124],"normal":[127],"distribution":[128],"non\u2010negative":[130],"correlation":[131],"structures.":[132],"Computational":[133],"experiments":[134],"large\u2010scale":[136],"transportation":[137],"networks":[138],"(with":[139],"up":[140],"33":[142],"113":[143],"nodes":[144],"75":[146],"379":[147],"arcs)":[148],"demonstrate":[149],"achieves":[153],"ten\u2010fold":[155],"speed":[156],"improvement":[157],"over":[158],"state\u2010of\u2010the\u2010art":[159],"methods,":[160],"highlighting":[161],"its":[162],"potential":[163],"real\u2010world":[164],"applications":[165],"extensions":[167],"related":[169],"problems.":[170]},"counts_by_year":[],"updated_date":"2026-05-05T06:06:40.768181","created_date":"2026-01-20T00:00:00"}