{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:02:46Z","timestamp":1776783766983,"version":"3.51.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T00:00:00Z","timestamp":1456185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10287-016-0249-2","type":"journal-article","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T12:48:12Z","timestamp":1456231692000},"page":"219-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["Decomposition for adjustable robust linear optimization subject to uncertainty polytope"],"prefix":"10.1007","volume":"13","author":[{"given":"Josette","family":"Ayoub","sequence":"first","affiliation":[]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,23]]},"reference":[{"key":"249_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C Audet","year":"1997","unstructured":"Audet C, Hansen P, Jaumard B, Savard G (1997) Links between linear bilevel and mixed 0\u20131 programming problems. J Optim Theory Appl 93:273\u2013300","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"249_CR2","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769\u2013805","journal-title":"Math Oper Res"},{"key":"249_CR3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal A, Nemirovski A (2002) Robust optimization methodology and applications. Math Program 92:453\u2013480","journal-title":"Math Program"},{"issue":"2","key":"249_CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351\u2013376","journal-title":"Math Program"},{"issue":"12","key":"249_CR5","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/TAC.2010.2049764","volume":"55","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas D, Caramanis C (2010) Finite adaptability in multistage linear optimization. IEEE Trans Autom Control 55(12):2751\u20132766","journal-title":"IEEE Trans Autom Control"},{"key":"249_CR6","unstructured":"Bertsimas D, Dunning I (2014) Multistage robust mixed integer optimization with adaptive partitions. Under review"},{"key":"249_CR7","doi-asserted-by":"crossref","unstructured":"Bertsimas D, Georghiou A (2015) Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper Res 63(3):610\u2013627","DOI":"10.1287\/opre.2015.1365"},{"issue":"2","key":"249_CR8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-011-0444-4","volume":"134","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas D, Goyal V (2012) On the power and limitations of affine policies in two-stage adaptive optimization. Math Program 134(2):491\u2013531","journal-title":"Math Program"},{"key":"249_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52:35\u201353","journal-title":"Oper Res"},{"issue":"1","key":"249_CR10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.1110.0482","volume":"36","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Goyal V, Sun XA (2011a) A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization. Math Oper Res 36(1):24\u201354","journal-title":"Math Oper Res"},{"issue":"12","key":"249_CR11","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TAC.2011.2162878","volume":"56","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Iancu D, Parrilo P (2011b) A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans Autom Control 56(12):2809\u20132824","journal-title":"IEEE Trans Autom Control"},{"key":"249_CR12","doi-asserted-by":"crossref","unstructured":"Bertsimas D, Litvinov E, Sun XA, Zhao J, Zheng T (2013) Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans Power Syst 28(1):52\u201363","DOI":"10.1109\/TPWRS.2012.2205021"},{"issue":"2","key":"249_CR13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.disopt.2006.12.002","volume":"5","author":"D Bienstock","year":"2008","unstructured":"Bienstock D, \u00d6zbay N (2008) Computing robust basestock levels. Discret Optim 5(2):389\u2013414","journal-title":"Discret Optim"},{"key":"249_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.dam.2014.01.017","volume":"170","author":"A Billionnet","year":"2014","unstructured":"Billionnet A, Costa M-C, Poirion P-L (2014) 2-stage robust MILP with continuous recourse variables. Discrete Appl Math 170:21\u201332","journal-title":"Discrete Appl Math"},{"issue":"6","key":"249_CR15","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"X Chen","year":"2009","unstructured":"Chen X, Zhang Y (2009) Uncertain linear programs: extended affinely adjustable robust counterparts. Oper Res 57(6):1469\u20131482","journal-title":"Oper Res"},{"issue":"2","key":"249_CR16","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.1070.0457","volume":"56","author":"X Chen","year":"2008","unstructured":"Chen X, Sim M, Sun P, Zhang J (2008) A linear decision-based approximation approach to stochastic programming. Oper Res 56(2):344\u2013357","journal-title":"Oper Res"},{"issue":"2","key":"249_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201\u2013213","journal-title":"Math Program"},{"issue":"1","key":"249_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L Ghaoui El","year":"1998","unstructured":"El Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9(1):33\u201352","journal-title":"SIAM J Optim"},{"issue":"1","key":"249_CR19","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.dam.2011.09.015","volume":"164","author":"V Gabrel","year":"2014","unstructured":"Gabrel V, Lacroix M, Murat C, Remli N (2014) Robust location transportation problems under uncertain demands. Discrete Appl Math 164(1):100\u2013111","journal-title":"Discrete Appl Math"},{"key":"249_CR20","doi-asserted-by":"crossref","unstructured":"Goh J, Sim M (2010) Distributionally robust optimization and its tractable approximations. Oper Res 58(4-Part-1):902\u2013917","DOI":"10.1287\/opre.1090.0795"},{"issue":"4","key":"249_CR21","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.2013.1172","volume":"61","author":"D Iancu","year":"2013","unstructured":"Iancu D, Sharma M, Sviridenko M (2013) Supermodularity and affine policies in dynamic robust optimization. Oper Res 61(4):941\u2013956","journal-title":"Oper Res"},{"key":"249_CR22","unstructured":"IBM-ILOG (2015) IBM-ILOG Cplex"},{"key":"249_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its application","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its application. Kluwer Academic Publishers, London"},{"issue":"2","key":"249_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui T (1996) Np-hardness of linear multiplicative programming and related problems. J Global Optim 9(2):113\u2013119","journal-title":"J Global Optim"},{"issue":"3","key":"249_CR25","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","volume":"54","author":"S Mattia","year":"2013","unstructured":"Mattia S (2013) The robust network loading problem with dynamic routing. Comp Opt Appl 54(3):619\u2013643","journal-title":"Comp Opt Appl"},{"key":"249_CR26","unstructured":"Mattia S (2014) Private communication"},{"issue":"3","key":"249_CR27","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski S, Pi\u00f3ro M, Tomaszewski A, Wess\u00e4ly R (2010) SNDlib 1.0-survivable network design library. Networks 55(3):276\u2013286","journal-title":"Networks"},{"key":"249_CR28","doi-asserted-by":"crossref","unstructured":"Poss M (2014) A comparison of routing sets for robust network design. Optim Let 8(5):1619\u20131635","DOI":"10.1007\/s11590-013-0679-5"},{"issue":"2","key":"249_CR29","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/net.21482","volume":"61","author":"M Poss","year":"2013","unstructured":"Poss M, Raack C (2013) Affine recourse for the robust network design problem: between static and dynamic routing. Networks 61(2):180\u2013198","journal-title":"Networks"},{"key":"249_CR30","doi-asserted-by":"crossref","unstructured":"Postek K, Den Hertog D (2014) Multi-stage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set. CentER Discussion Paper Series","DOI":"10.2139\/ssrn.2502825"},{"issue":"4","key":"249_CR31","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"HS Ryoo","year":"2003","unstructured":"Ryoo HS, Sahinidis NV (2003) Global optimization of multiplicative programs. J Global Optim 26(4):387\u2013418","journal-title":"J Global Optim"},{"issue":"5","key":"249_CR32","first-page":"457461","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng B, Zhao L (2013) Solving two-stage robust optimization problems by a constraint-and-column generation method. Oper Res Let 41(5):457461","journal-title":"Oper Res Let"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0249-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-016-0249-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0249-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T15:09:19Z","timestamp":1718377759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-016-0249-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,23]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s10287-016-0249-2","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,23]]}}}