{"id":"https://openalex.org/W288933678","doi":"https://doi.org/10.1137/100789269","title":"Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization","display_name":"Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W288933678","doi":"https://doi.org/10.1137/100789269","mag":"288933678"},"language":"en","primary_location":{"id":"doi:10.1137/100789269","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100789269","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031968426","display_name":"Chaitanya Swamy","orcid":"https://orcid.org/0000-0003-1108-7941"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chaitanya Swamy","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030030349","display_name":"David B. Shmoys","orcid":"https://orcid.org/0000-0003-3882-901X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David B. Shmoys","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031968426"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.03127396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"41","issue":"4","first_page":"975","last_page":"1004"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.6938731670379639},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.5844736099243164},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5588165521621704},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5321941375732422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5319122672080994},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46644920110702515},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45846471190452576},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.4502677917480469},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.449779212474823},{"id":"https://openalex.org/keywords/expected-value","display_name":"Expected value","score":0.412855863571167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34328627586364746},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11567944288253784}],"concepts":[{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.6938731670379639},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.5844736099243164},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5588165521621704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5321941375732422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5319122672080994},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46644920110702515},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45846471190452576},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.4502677917480469},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.449779212474823},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.412855863571167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34328627586364746},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11567944288253784},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1137/100789269","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100789269","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:authors.library.caltech.edu:25092","is_oa":false,"landing_page_url":"https://authors.library.caltech.edu/25092/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.7241","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.7241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~cswamy/papers/multistage.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.127.1826","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.1826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~cswamy/papers/multistagefnl.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.7095","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~cswamy/papers/multistagefnl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.3084","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~cswamy/papers/multistage.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.8496","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.8496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~cswamy/papers/multistage.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.7269","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~cswamy/papers/multistage.pdf","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:1290","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.2","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/dagsemproc.07391.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/dagsemproc.07391.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:288933678","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2007/1290/pdf/07391.SwamyChaitanya.Paper.1290.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418148","display_name":"Dagstuhl Seminar Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Dagstuhl Seminar Proceedings","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:1290","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.2","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[{"id":"https://openalex.org/G5551496002","display_name":"Approximation Algorithms for Scheduling, Packing, and Related Logistics Problems","funder_award_id":"0430682","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W182881619","https://openalex.org/W569789896","https://openalex.org/W1484951415","https://openalex.org/W1490324987","https://openalex.org/W1523452202","https://openalex.org/W1569990960","https://openalex.org/W1981673685","https://openalex.org/W1983916623","https://openalex.org/W2002285507","https://openalex.org/W2011232221","https://openalex.org/W2057974767","https://openalex.org/W2064227123","https://openalex.org/W2090343757","https://openalex.org/W2109156431","https://openalex.org/W2112058494","https://openalex.org/W2117399775","https://openalex.org/W2121638441","https://openalex.org/W2125295283","https://openalex.org/W2140844111","https://openalex.org/W2164185614"],"related_works":["https://openalex.org/W1565242130","https://openalex.org/W2019875157","https://openalex.org/W2951146832","https://openalex.org/W2052371896","https://openalex.org/W2048772520","https://openalex.org/W1598073724","https://openalex.org/W2001280958","https://openalex.org/W1553572425","https://openalex.org/W2056358929","https://openalex.org/W2304770202","https://openalex.org/W2171261418","https://openalex.org/W2952596000","https://openalex.org/W2952211163","https://openalex.org/W3207922128","https://openalex.org/W2964063620","https://openalex.org/W1838590309","https://openalex.org/W54890861","https://openalex.org/W3110535523","https://openalex.org/W2952906047","https://openalex.org/W2963838686"],"abstract_inverted_index":{"Stochastic":[0],"optimization":[1,202],"problems":[2,37,118,203],"provide":[3],"a":[4,19,32,46,72,77,110,155,162,170,194],"means":[5,153],"to":[6,101,176,187],"model":[7],"uncertainty":[8,15],"in":[9,38,62,94,145],"the":[10,14,23,27,40,83,89,103,130,140,150,167,173,177,189,205],"input":[11,42,151,174],"data":[12],"where":[13],"is":[16,43,71,100,135,139],"modeled":[17],"by":[18,152],"probability":[20,179],"distribution":[21,180],"over":[22],"possible":[24],"realizations":[25],"of":[26,35,48,80,91,113,123,154,164,172,196,199],"actual":[28],"data.":[29],"We":[30,184],"consider":[31],"broad":[33,111],"class":[34,112],"these":[36],"which":[39],"realized":[41],"revealed":[44],"through":[45],"series":[47,163],"stages":[49],"and":[50,138,215],"hence":[51],"are":[52],"called":[53],"multistage":[54,64,114],"stochastic":[55,59,65,115],"programming":[56,60,117],"problems.":[57,218],"Multistage":[58],"and,":[61],"particular,":[63],"linear":[66,116],"programs":[67],"with":[68,119],"full":[69],"recourse,":[70],"domain":[73],"that":[74,158],"has":[75],"received":[76],"great":[78],"deal":[79],"attention":[81],"within":[82],"operations":[84],"research":[85],"community,":[86],"mostly":[87],"from":[88],"perspective":[90],"computational":[92],"results":[93],"application":[95],"settings.":[96],"Our":[97],"main":[98],"result":[99],"give":[102],"first":[104,190],"fully":[105],"polynomial":[106],"approximation":[107,133,191],"scheme":[108],"for":[109,166,193],"any":[120],"constant":[121],"number":[122],"stages.":[124],"The":[125,147],"algorithm":[126,148],"analyzed,":[127],"known":[128],"as":[129],"sample":[131,171],"average":[132],"method,":[134],"quite":[136],"simple":[137],"one":[141],"most":[142],"commonly":[143],"used":[144],"practice.":[146],"accesses":[149],"\u201cblack":[156],"box\u201d":[157],"can":[159],"generate,":[160],"given":[161],"outcomes":[165],"initial":[168],"stages,":[169],"according":[175],"conditional":[178],"(given":[181],"those":[182],"outcomes).":[183],"use":[185],"this":[186],"obtain":[188],"algorithms":[192],"variety":[195],"$k$-stage":[197],"generalizations":[198],"basic":[200],"combinatorial":[201],"including":[204],"set":[206],"cover,":[207,209],"vertex":[208],"multicut":[210],"on":[211],"trees,":[212],"facility":[213],"location,":[214],"multicommodity":[216],"flow":[217]},"counts_by_year":[],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}