{"id":"https://openalex.org/W2039114216","doi":"https://doi.org/10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l","title":"Stochastic shortest path problems with recourse","display_name":"Stochastic shortest path problems with recourse","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2039114216","doi":"https://doi.org/10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l","mag":"2039114216"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/3319","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016814241","display_name":"George Polychronopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"George H. Polychronopoulos","raw_affiliation_strings":["Operations Research Center, M.I.T., Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Operations Research Center, M.I.T., Cambridge, Massachusetts 02139","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108523422","display_name":"John N. Tsitsiklis","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John N. Tsitsiklis","raw_affiliation_strings":["Laboratory for information and Decision Systems and the Operations Research Center, M.I.T., Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Laboratory for information and Decision Systems and the Operations Research Center, M.I.T., Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I4210143601"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016814241"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1003,"has_fulltext":true,"cited_by_count":208,"citation_normalized_percentile":{"value":0.81238225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"27","issue":"2","first_page":"133","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9948999881744385,"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.7748382091522217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6268886923789978},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5661220550537109},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5654524564743042},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5453807711601257},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.499894380569458},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49088388681411743},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4894470274448395},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4318860173225403},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.43099892139434814},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4196704924106598},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3865465819835663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3392311632633209},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20058229565620422}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7748382091522217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6268886923789978},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5661220550537109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5654524564743042},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5453807711601257},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.499894380569458},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49088388681411743},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4894470274448395},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4318860173225403},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.43099892139434814},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4196704924106598},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3865465819835663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3392311632633209},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20058229565620422},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l","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:oai:CiteSeerX.psu:10.1.1.85.7538","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.7538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/3319/1/P-2183-28755605.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/3319","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/3319","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/3319","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/3319","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309015","display_name":"Charles Stark Draper Laboratory","ror":"https://ror.org/04378d909"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1523334965","https://openalex.org/W1538209031","https://openalex.org/W1545148916","https://openalex.org/W1972886737","https://openalex.org/W1986564315","https://openalex.org/W2008896030","https://openalex.org/W2019851160","https://openalex.org/W2032100464","https://openalex.org/W2048608180","https://openalex.org/W2051213257","https://openalex.org/W2057742448","https://openalex.org/W2062568266","https://openalex.org/W2081287319","https://openalex.org/W2115826669","https://openalex.org/W2217243206"],"related_works":["https://openalex.org/W2388410942","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2022506245","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W1966110800"],"abstract_inverted_index":{"We":[0,12,48],"consider":[1],"shortest":[2],"path":[3],"problems":[4],"defined":[5],"on":[6,16],"graphs":[7],"with":[8,44],"random":[9],"arc":[10,17],"costs.":[11],"assume":[13],"that":[14,35],"information":[15],"cost":[18],"values":[19],"is":[20,25,30],"accumulated":[21],"as":[22],"the":[23],"graph":[24],"being":[26],"traversed.":[27],"The":[28],"objective":[29],"to":[31,40],"devise":[32],"a":[33,41],"policy":[34],"leads":[36],"from":[37],"an":[38],"origin":[39],"destination":[42],"node":[43],"minimal":[45],"expected":[46],"cost.":[47],"provide":[49],"dynamic":[50],"programming":[51],"algorithms,":[52],"estimates":[53],"for":[54],"their":[55],"complexity,":[56],"negative":[57],"complexity":[58],"results,":[59],"and":[60],"analysis":[61],"of":[62],"some":[63],"possible":[64],"heuristic":[65],"algorithms.":[66],"\u00a9":[67],"1996":[68],"John":[69],"Wiley":[70],"&":[71],"Sons,":[72],"Inc.":[73]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}