{"id":"https://openalex.org/W2746381058","doi":"https://doi.org/10.1137/16m1075594","title":"A Scalable Bounding Method for Multistage Stochastic Programs","display_name":"A Scalable Bounding Method for Multistage Stochastic Programs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2746381058","doi":"https://doi.org/10.1137/16m1075594","mag":"2746381058"},"language":"en","primary_location":{"id":"doi:10.1137/16m1075594","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1075594","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","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/A5038631687","display_name":"Burhaneddin Sand\u0131k\u00e7\u0131","orcid":"https://orcid.org/0000-0003-3202-8289"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Burhaneddi\u0307n Sandik\u00e7i","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011081239","display_name":"Osman Y. \u00d6zalt\u0131n","orcid":"https://orcid.org/0000-0002-0093-5645"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Osman Y. \u00d6zaltin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4935,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92790594,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"27","issue":"3","first_page":"1772","last_page":"1800"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9983999729156494,"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.9983999729156494,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9861000180244446,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.7069172859191895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6410436630249023},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5794113278388977},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5691890716552734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3426084816455841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3255525827407837},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14682456851005554}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7069172859191895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6410436630249023},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5794113278388977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5691890716552734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3426084816455841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3255525827407837},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14682456851005554},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1075594","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1075594","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.699999988079071}],"awards":[{"id":"https://openalex.org/G2598835167","display_name":null,"funder_award_id":"CMMI-1435771","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3624976998","display_name":null,"funder_award_id":"CMMI-1436177","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"},{"id":"https://openalex.org/F4320332552","display_name":"Booth School of Business, University of Chicago","ror":"https://ror.org/024mw5h28"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W893700568","https://openalex.org/W1971454274","https://openalex.org/W1976667494","https://openalex.org/W1977380350","https://openalex.org/W1983916623","https://openalex.org/W1995209616","https://openalex.org/W1999563417","https://openalex.org/W2000953623","https://openalex.org/W2004020123","https://openalex.org/W2008789074","https://openalex.org/W2017339608","https://openalex.org/W2025652703","https://openalex.org/W2033793554","https://openalex.org/W2040358553","https://openalex.org/W2048305092","https://openalex.org/W2053285890","https://openalex.org/W2055427220","https://openalex.org/W2060013459","https://openalex.org/W2087682750","https://openalex.org/W2097596248","https://openalex.org/W2103622041","https://openalex.org/W2109277200","https://openalex.org/W2119750259","https://openalex.org/W2123531696","https://openalex.org/W2142073449","https://openalex.org/W2164414207","https://openalex.org/W2164768462","https://openalex.org/W2304662403","https://openalex.org/W3123072800","https://openalex.org/W3125763446"],"related_works":["https://openalex.org/W1527726406","https://openalex.org/W2364921833","https://openalex.org/W2388030554","https://openalex.org/W2302028273","https://openalex.org/W1525643724","https://openalex.org/W2382623646","https://openalex.org/W3087771547","https://openalex.org/W2333420780","https://openalex.org/W2795601052","https://openalex.org/W2375199418"],"abstract_inverted_index":{"Many":[0],"dynamic":[1],"decision":[2,116],"problems":[3],"involving":[4],"uncertainty":[5],"can":[6],"be":[7],"appropriately":[8],"modeled":[9],"as":[10,83],"multistage":[11,66],"stochastic":[12,59,67],"programs.":[13],"However,":[14],"most":[15],"practical":[16,141],"instances":[17,106,142],"are":[18],"so":[19],"large":[20],"and/or":[21],"complex":[22],"that":[23,123],"it":[24,84,94],"is":[25,80],"impossible":[26],"to":[27,36,109,136,140],"solve":[28],"them":[29],"on":[30,57,75],"a":[31,71,98,144],"single":[32],"computer,":[33],"especially":[34],"due":[35],"memory":[37],"limitations.":[38],"Extending":[39],"the":[40,124],"work":[41],"of":[42],"[B.":[43],"Sandikci,":[44],"N.":[45],"Kong,":[46],"and":[47,69,132],"A.":[48],"J.":[49],"Schaefer,":[50],"Math.":[51],"Program.,":[52],"138":[53],"(2013),":[54],"pp.":[55],"253--272]":[56],"two-stage":[58],"mixed-integer":[60],"programs,":[61],"this":[62],"paper":[63],"considers":[64],"general":[65],"programs":[68],"develops":[70],"bounding":[72],"method":[73,79,126],"based":[74],"scenario":[76],"decomposition.":[77],"This":[78],"broadly":[81],"applicable,":[82],"does":[85],"not":[86],"assume":[87],"any":[88],"problem":[89,130],"structure":[90],"including":[91],"convexity.":[92],"Moreover,":[93],"naturally":[95],"fits":[96],"into":[97],"distributed":[99],"computing":[100],"environment.":[101],"Computational":[102],"experiments":[103],"with":[104,129],"large-scale":[105],"(with":[107],"up":[108],"100":[110],"million":[111,120],"scenarios,":[112],"about":[113],"1.5":[114],"billion":[115],"variables---85%":[117],"binary---and":[118],"800":[119],"constraints)":[121],"demonstrate":[122],"proposed":[125],"scales":[127],"nicely":[128],"size":[131],"has":[133],"immense":[134],"potential":[135],"obtain":[137],"high-quality":[138],"solutions":[139],"within":[143],"reasonable":[145],"time":[146],"frame.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}