{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T03:35:48Z","timestamp":1770435348259,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,22]],"date-time":"2012-09-22T00:00:00Z","timestamp":1348272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00186-012-0405-6","type":"journal-article","created":{"date-parts":[[2012,9,21]],"date-time":"2012-09-21T19:48:20Z","timestamp":1348256900000},"page":"323-343","source":"Crossref","is-referenced-by-count":38,"title":["On the approximability of adjustable robust convex optimization under uncertainty"],"prefix":"10.1007","volume":"77","author":[{"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,22]]},"reference":[{"issue":"2","key":"405_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","volume":"17","author":"EML Beale","year":"1955","unstructured":"Beale EML (1955) On minizing a convex function subject to linear inequalities. J R Stat Soc Ser B (Method) 17(2): 173\u2013184","journal-title":"J R Stat Soc Ser B (Method)"},{"key":"405_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University press, Princeton"},{"issue":"2","key":"405_CR3","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":"4","key":"405_CR4","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"},{"issue":"1","key":"405_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25(1): 1\u201314","journal-title":"Oper Res Lett"},{"issue":"3","key":"405_CR6","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\u2013methodology and applications. Math Program 92(3): 453\u2013480","journal-title":"Math Program"},{"key":"405_CR7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/moor.1090.0440","volume":"35","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas D, Goyal V (2010) On the power of robust solutions in two-stage stochastic and adaptive optimization problems. Math Oper Res 35: 284\u2013305","journal-title":"Math Oper Res"},{"key":"405_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011a) Theory applications of robust optimization. SIAM Rev 53: 464\u2013501","journal-title":"SIAM Rev"},{"key":"405_CR9","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 A (2011b) A geometric characterization of the power of finite adaptability in multi-stage stochastic and adaptive optimization. Math Oper Res 36: 24\u201354","journal-title":"Math Oper Res"},{"key":"405_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program Ser B 98: 49\u201371","journal-title":"Math Program Ser B"},{"issue":"2","key":"405_CR11","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(2): 35\u201353","journal-title":"Oper Res"},{"key":"405_CR12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"GB Dantzig","year":"1955","unstructured":"Dantzig GB (1955) Linear programming under uncertainty. Manag Sci 1: 197\u2013206","journal-title":"Manag Sci"},{"issue":"3","key":"405_CR13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-005-0597-0","volume":"106","author":"M Dyer","year":"2006","unstructured":"Dyer M, Stougie L (2006) Computational complexity of stochastic programming problems. Math Program 106(3): 423\u2013432","journal-title":"Math Program"},{"key":"405_CR14","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El Ghaoui","year":"1997","unstructured":"El Ghaoui L, Lebret H (1997) Robust solutions to least-squares problems with uncertain data. SIAM J Matrix Anal Appl 18: 1035\u20131064","journal-title":"SIAM J Matrix Anal Appl"},{"key":"405_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-540-72792-7_33","volume":"4513","author":"U Feige","year":"2007","unstructured":"Feige U, Jain K, Mahdian M, Mirrokni V (2007) Robust combinatorial optimization with exponential scenarios. Lect Notes Comput Sci 4513: 439\u2013453","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"405_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"D Goldfarb","year":"2003","unstructured":"Goldfarb D, Iyengar G (2003) Robust portfolio selection problems. Math Oper Res 28(1): 1\u201338","journal-title":"Math Oper Res"},{"issue":"2","key":"405_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2): 169\u2013197","journal-title":"Combinatorica"},{"key":"405_CR18","volume-title":"Planning under uncertainty: solving large-scale stochastic linear programs","author":"G Infanger","year":"1994","unstructured":"Infanger G (1994) Planning under uncertainty: solving large-scale stochastic linear programs. Boyd & Fraser Pub Co, Danvers"},{"key":"405_CR19","volume-title":"Stochastic programming","author":"P Kall","year":"1994","unstructured":"Kall P, Wallace SW (1994) Stochastic programming. Wiley , New York"},{"key":"405_CR20","first-page":"103","volume":"2","author":"H Minkowski","year":"1911","unstructured":"Minkowski H (1911) Allegemeine Lehrs\u00e4tze \u00fcber konvexen Polyeder. Ges. Ahb. 2: 103\u2013121","journal-title":"Ges. Ahb."},{"key":"405_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa A (1995) Stochastic programming. Kluwer, Dordrecht, Boston"},{"issue":"1","key":"405_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-006-0090-4","volume":"112","author":"A Shapiro","year":"2008","unstructured":"Shapiro A (2008) Stochastic programming approach to optimization under uncertainty. Math Program Ser B 112(1): 183\u2013220","journal-title":"Math Program Ser B"},{"key":"405_CR23","doi-asserted-by":"crossref","unstructured":"Shapiro A, Dentcheva D, Ruszczy\u0144ski A (2009) Lectures on stochastic programming: modeling and theory. Soc Ind Appl Math 9","DOI":"10.1137\/1.9780898718751"},{"key":"405_CR24","doi-asserted-by":"crossref","unstructured":"Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. In: Jeyakumar V, Rubinov AM (eds) Continuous optimization: current trends and applications. Springer, pp 111\u2013146","DOI":"10.1007\/0-387-26771-9_4"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0405-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0405-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0405-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T17:47:58Z","timestamp":1714412878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0405-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,22]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["405"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0405-6","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,22]]}}}