{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:20:35Z","timestamp":1770448835497,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T00:00:00Z","timestamp":1514851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T00:00:00Z","timestamp":1514851200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["1201116"],"award-info":[{"award-number":["1201116"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["1351838"],"award-info":[{"award-number":["1351838"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10107-017-1222-8","type":"journal-article","created":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T00:51:45Z","timestamp":1514854305000},"page":"313-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints"],"prefix":"10.1007","volume":"173","author":[{"given":"Pranjal","family":"Awasthi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian Y.","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,2]]},"reference":[{"key":"1222_CR1","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. In: 34th Annual Symposium on Foundations of Computer Science, 1993. Proceedings, pp. 724\u2013733. IEEE (1993)"},{"key":"1222_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"4","key":"1222_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1222_CR4","doi-asserted-by":"publisher","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.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201314 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1222_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust optimization-methodology and applications. Math. Program. 92(3), 453\u2013480 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"1222_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"3","key":"1222_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/ijoc.2016.0689","volume":"28","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., de Ruiter, F.J.C.T.: Duality in two-stage adaptive linear optimization: faster computation and stronger bounds. INFORMS J. Comput. 28(3), 500\u2013511 (2016)","journal-title":"INFORMS J. Comput."},{"key":"1222_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/moor.1090.0440","volume":"35","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Goyal, V.: On the power of robust solutions in two-stage stochastic and adaptive optimization problems. Math. Oper. Res. 35, 284\u2013305 (2010)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1222_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-011-0444-4","volume":"134","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Goyal, V.: On the power and limitations of affine policies in two-stage adaptive optimization. Math. Program. 134(2), 491\u2013531 (2012)","journal-title":"Math. Program."},{"issue":"3","key":"1222_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00186-012-0405-6","volume":"77","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Goyal, V.: On the approximability of adjustable robust convex optimization under uncertainty. Math. Methods Oper. Res. 77(3), 323\u2013343 (2013)","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"1222_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10107-014-0768-y","volume":"150","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., Goyal, V., Lu, B.Y.: A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. Math. Program. 150(2), 281\u2013319 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1222_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.1110.0482","volume":"36","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Goyal, V., Sun, X.A.: A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization. Math. Oper. Res. 36(1), 24\u201354 (2011)","journal-title":"Math. Oper. Res."},{"key":"1222_CR13","unstructured":"Bertsimas, D., Natarajan, K., Teo, C.-P.: Applications of semidefinite optimization in stochastic project scheduling. Technical report, High Performance Computation for Engineered Systems, Singapore\u2013MIT Alliance (2002)"},{"key":"1222_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. Ser. B 98, 49\u201371 (2003)","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"1222_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(2), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"1222_CR16","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 395\u2013404. Society for Industrial and Applied Mathematics (2005)"},{"key":"1222_CR17","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18, 1035\u20131064 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"1222_CR18","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"key":"1222_CR19","doi-asserted-by":"publisher","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.: Robust combinatorial optimization with exponential scenarios. Lect. Notes Comput. Sci. 4513, 439\u2013453 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1222_CR20","unstructured":"Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 579\u2013586. IEEE (1999)"},{"issue":"1","key":"1222_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"D Goldfarb","year":"2003","unstructured":"Goldfarb, D., Iyengar, G.: Robust portfolio selection problems. Math. Oper. Res. 28(1), 1\u201338 (2003)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1222_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.orl.2010.01.003","volume":"38","author":"V Goyal","year":"2010","unstructured":"Goyal, V., Ravi, R.: A ptas for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3), 161\u2013164 (2010)","journal-title":"Oper. Res. Lett."},{"key":"1222_CR23","doi-asserted-by":"crossref","unstructured":"Hadjiyiannis, M.J., Goulart, P.J., Kuhn, D.: A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. In: 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), pp. 7386\u20137391. IEEE (2011)","DOI":"10.1109\/CDC.2011.6161342"},{"key":"1222_CR24","volume-title":"Stochastic Programming","author":"P Kall","year":"1994","unstructured":"Kall, P., Wallace, S.W.: Stochastic Programming. Wiley, New York (1994)"},{"key":"1222_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A.: Stochastic Programming. Kluwer Academic Publishers, Dordrecht (1995)"},{"issue":"1","key":"1222_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-006-0090-4","volume":"112","author":"A Shapiro","year":"2008","unstructured":"Shapiro, A.: Stochastic programming approach to optimization under uncertainty. Math. Program. Ser. B 112(1), 183\u2013220 (2008)","journal-title":"Math. Program. Ser. B"},{"key":"1222_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"1222_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/0-387-26771-9_4","volume-title":"Continuous Optimization: Current Trends and Applications","author":"A Shapiro","year":"2005","unstructured":"Shapiro, A., Nemirovski, A.: On complexity of stochastic programming problems. In: Jeyakumar, V., Rubinov, A.M. (eds.) Continuous Optimization: Current Trends and Applications, pp. 111\u2013144. Springer, Berlin (2005)"},{"issue":"5","key":"1222_CR29","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A Soyster","year":"1973","unstructured":"Soyster, A.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"key":"1222_CR30","volume-title":"Approx. Algorithms","author":"V Vazirani","year":"2013","unstructured":"Vazirani, V.: Approx. Algorithms. Springer, Berlin (2013)"},{"issue":"1\u20132","key":"1222_CR31","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-011-0478-7","volume":"135","author":"W Wiesemann","year":"2012","unstructured":"Wiesemann, W., Kuhn, D., Rustem, B.: Robust resource allocations in temporal networks. Math. Program. 135(1\u20132), 437\u2013471 (2012)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1222-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1222-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1222-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:31:26Z","timestamp":1589646686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1222-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,2]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1222"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1222-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,2]]},"assertion":[{"value":"15 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}