{"id":"https://openalex.org/W2057742448","doi":"https://doi.org/10.1002/net.3230180306","title":"Stochastic shortest paths with recourse","display_name":"Stochastic shortest paths with recourse","publication_year":1988,"publication_date":"1988-09-01","ids":{"openalex":"https://openalex.org/W2057742448","doi":"https://doi.org/10.1002/net.3230180306","mag":"2057742448"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230180306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180306","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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074949877","display_name":"Giovanni Andreatta","orcid":"https://orcid.org/0000-0002-5536-400X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Giovanni Andreatta","raw_affiliation_strings":["Faculty of Statistics, via del Santo 22, 35133 Padova, Italy"],"affiliations":[{"raw_affiliation_string":"Faculty of Statistics, via del Santo 22, 35133 Padova, Italy","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108532741","display_name":"Luciano Romeo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luciano Romeo","raw_affiliation_strings":["Faculty of Statistics, via del Santo 22, 35133 Padova, Italy"],"affiliations":[{"raw_affiliation_string":"Faculty of Statistics, via del Santo 22, 35133 Padova, Italy","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074949877"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.15768749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"18","issue":"3","first_page":"193","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision 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.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/counterintuitive","display_name":"Counterintuitive","score":0.6138952374458313},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6022500395774841},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5949726104736328},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5421150922775269},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5400828123092651},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5302940011024475},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47151505947113037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38156789541244507},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28979331254959106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1323838233947754},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11784061789512634}],"concepts":[{"id":"https://openalex.org/C101097943","wikidata":"https://www.wikidata.org/wiki/Q5176983","display_name":"Counterintuitive","level":2,"score":0.6138952374458313},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6022500395774841},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5949726104736328},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5421150922775269},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5400828123092651},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5302940011024475},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47151505947113037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38156789541244507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28979331254959106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1323838233947754},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11784061789512634},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/net.3230180306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180306","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:hdl:10068/317919","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/317919","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Y - Progress report"},{"id":"pmh:oai:www.research.unipd.it:11577/111242","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/111242","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W64605562","https://openalex.org/W1965630584","https://openalex.org/W1972886737","https://openalex.org/W1986564315","https://openalex.org/W1994015283","https://openalex.org/W2016049811","https://openalex.org/W2027580688","https://openalex.org/W2028145673","https://openalex.org/W2035446426","https://openalex.org/W2048608180","https://openalex.org/W2051213257","https://openalex.org/W2059014957","https://openalex.org/W2062568266","https://openalex.org/W2119702428","https://openalex.org/W2141694395","https://openalex.org/W2312584017","https://openalex.org/W2321292752","https://openalex.org/W2482182218","https://openalex.org/W3022714473","https://openalex.org/W3171412313","https://openalex.org/W4300192488"],"related_works":["https://openalex.org/W2809491669","https://openalex.org/W3005839474","https://openalex.org/W2050235149","https://openalex.org/W4379988549","https://openalex.org/W2139510495","https://openalex.org/W2016376779","https://openalex.org/W2807993762","https://openalex.org/W1992379025","https://openalex.org/W2768389068","https://openalex.org/W2403993643"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"Stochastic":[4],"Shortest":[5],"Path":[6],"(SSP)":[7],"problems":[8],"in":[9,20,25],"probabilistic":[10],"networks.":[11],"A":[12],"variety":[13],"of":[14,67,80,83,97],"approaches":[15],"have":[16,39],"already":[17],"been":[18],"proposed":[19],"the":[21,26,44,49,56,65,72,78,81,91,94],"literature.":[22],"However,":[23],"unlike":[24],"deterministic":[27],"case,":[28],"they":[29],"are":[30],"related":[31],"to":[32,41,87],"distinct":[33],"models,":[34],"interpretations":[35],"and":[36,90],"applications.":[37],"We":[38],"chosen":[40],"look":[42],"at":[43],"case":[45],"where":[46],"detours":[47],"from":[48],"original":[50],"path":[51],"must":[52],"be":[53],"taken":[54],"whenever":[55],"\u201cfirst\u2010choice\u201d":[57],"arc":[58],"fails.":[59],"The":[60],"main":[61],"results":[62],"obtained":[63],"include":[64],"proof":[66,79,92],"some":[68],"counterintuitive":[69],"facts":[70],"(e.g.,":[71],"SSP":[73,100],"may":[74],"contain":[75],"a":[76,98],"cycle),":[77],"validity":[82],"applying":[84],"stochastic":[85],"programming":[86],"this":[88],"problem":[89,101],"that":[93],"computational":[95],"complexity":[96],"particular":[99],"is":[102],"polynomial.":[103]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}