{"id":"https://openalex.org/W2004920849","doi":"https://doi.org/10.1002/net.3230240304","title":"Stochastic programs over trees with random arc capacities","display_name":"Stochastic programs over trees with random arc capacities","publication_year":1994,"publication_date":"1994-05-01","ids":{"openalex":"https://openalex.org/W2004920849","doi":"https://doi.org/10.1002/net.3230240304","mag":"2004920849"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230240304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240304","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/A5054833334","display_name":"Warren B. Powell","orcid":"https://orcid.org/0000-0002-4364-7555"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Warren B. Powell","raw_affiliation_strings":["Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey 08544","Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey 08544#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey 08544","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey 08544#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102114803","display_name":"Raymond K. Cheung","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raymond K. Cheung","raw_affiliation_strings":["Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":22.2192,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.99068449,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"3","first_page":"161","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9959999918937683,"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.9959999918937683,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9692000150680542,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9509999752044678,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/recursion","display_name":"Recursion (computer science)","score":0.7518371343612671},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6393880248069763},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5677809715270996},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.556921124458313},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5483636260032654},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5076612234115601},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5012423992156982},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4789574444293976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4687272310256958},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4544215798377991},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25038886070251465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19060200452804565},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0647105872631073}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7518371343612671},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6393880248069763},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5677809715270996},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.556921124458313},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5483636260032654},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5076612234115601},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5012423992156982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4789574444293976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4687272310256958},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4544215798377991},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25038886070251465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19060200452804565},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0647105872631073},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230240304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240304","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W34036749","https://openalex.org/W584430861","https://openalex.org/W1969007958","https://openalex.org/W1979915705","https://openalex.org/W1981893768","https://openalex.org/W1995033525","https://openalex.org/W2020523195","https://openalex.org/W2032912812","https://openalex.org/W2038426159","https://openalex.org/W2040358553","https://openalex.org/W2050285799","https://openalex.org/W2053150849","https://openalex.org/W2055854241","https://openalex.org/W2077378979","https://openalex.org/W2118152326","https://openalex.org/W2125690626","https://openalex.org/W2138492203","https://openalex.org/W2169441485","https://openalex.org/W2617045890"],"related_works":["https://openalex.org/W1976679120","https://openalex.org/W4281614748","https://openalex.org/W2377519369","https://openalex.org/W2765883196","https://openalex.org/W3202311233","https://openalex.org/W2034826746","https://openalex.org/W2118356379","https://openalex.org/W4248554653","https://openalex.org/W4389261498","https://openalex.org/W4297907812"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"we":[4,24,106],"study":[5],"a":[6,48,77,117],"special":[7],"class":[8],"of":[9,17,97,110],"stochastic":[10,120],"programs":[11],"where":[12],"the":[13,35,53,87,98,108,112],"recourse":[14,37,56,89,114],"problem":[15],"consists":[16],"trees":[18,66],"with":[19,80],"random":[20],"arc":[21],"capacities,":[22],"which":[23],"call":[25],"tree":[26,113],"recourse.":[27],"We":[28,61,83],"develop":[29],"an":[30],"efficient":[31],"procedure":[32,44],"to":[33,51],"obtain":[34],"expected":[36,55,88],"function":[38,57],"exactly":[39],"for":[40,58,64,91],"single\u2010stage":[41,78,92],"problems.":[42],"This":[43],"is":[45],"used":[46],"in":[47,116],"backward":[49],"recursion":[50],"find":[52],"exact":[54],"multistage":[59],"trees.":[60],"show":[62,85],"that":[63,86],"large":[65],"n":[67,81,94],"\u2010stage":[68,95],"networks":[69],"can":[70,76,101],"be":[71,102],"solved":[72],"more":[73,118],"easily":[74],"than":[75],"network":[79,100,121],"\u2010levels.":[82],"also":[84],"functions":[90],"and":[93],"formulations":[96],"same":[99],"quite":[103],"similar.":[104],"Finally,":[105],"illustrate":[107],"potential":[109],"using":[111],"problems":[115],"general":[119],"problem.":[122],"\u00a9":[123],"1994":[124],"by":[125],"John":[126],"Wiley":[127],"&":[128],"Sons,":[129],"Inc.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}