{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:18:53Z","timestamp":1767140333558,"version":"build-2238731810"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T00:00:00Z","timestamp":1445990400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"BMBF","award":["05M10WEC"],"award-info":[{"award-number":["05M10WEC"]}]},{"name":"ComplexWorld Research Network"},{"name":"DLR","award":["10-220210-C4"],"award-info":[{"award-number":["10-220210-C4"]}]},{"name":"WTT","award":["12190-1"],"award-info":[{"award-number":["12190-1"]}]},{"name":"NSF","award":["CMMI-1300144"],"award-info":[{"award-number":["CMMI-1300144"]}]}],"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-015-0243-0","type":"journal-article","created":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T07:05:38Z","timestamp":1446015938000},"page":"151-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study"],"prefix":"10.1007","volume":"13","author":[{"given":"Andreas","family":"B\u00e4rmann","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Heidt","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Thurner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,28]]},"reference":[{"key":"243_CR1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program A 88:411\u2013424","journal-title":"Math Program A"},{"key":"243_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal A, Nemirovski A (2001) On polyhedral approximations of the second-order cone. Math Oper Res 26:193\u2013205","journal-title":"Math Oper Res"},{"key":"243_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press","DOI":"10.1515\/9781400831050"},{"key":"243_CR4","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 B 98:49\u201371","journal-title":"Math Program B"},{"issue":"1","key":"243_CR5","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(1):35\u201353","journal-title":"Oper Res"},{"key":"243_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-005-0677-1","volume":"107","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas D, Sim M (2006) Tractable approximations to robust conic optimization problems. Math Program B 107:5\u201336","journal-title":"Math Program B"},{"key":"243_CR7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Pachamanovab D, Sim M (2004) Robust linear optimization under general norms. Oper Res Lett 32:510\u2013516","journal-title":"Oper Res Lett"},{"issue":"3","key":"243_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown D, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501","journal-title":"SIAM Rev"},{"key":"243_CR9","volume-title":"Numerical optimization\u2014theoretical and practical aspects","author":"JF Bonnans","year":"2009","unstructured":"Bonnans JF, Gilbert JC, Lemar\u00e9chal C, Sagastiz\u00e1bal CA (2009) Numerical optimization\u2014theoretical and practical aspects. Springer, New York"},{"key":"243_CR10","unstructured":"Boost C++ Libraries (2013) Boost random number library. http:\/\/www.boost.org\/doc\/libs\/1_38_0\/libs\/random"},{"issue":"1","key":"243_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2010) Extended formulations in combinatorial optimization. 4OR 8(1):1\u201348","journal-title":"4OR"},{"issue":"2","key":"243_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan E, Mor\u00e9 J (2002) Benchmarking optimization software with performance profiles. Math Program A 91(2):201\u2013213","journal-title":"Math Program A"},{"issue":"3","key":"243_CR13","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1007\/s00454-012-9421-9","volume":"48","author":"S Fiorini","year":"2012","unstructured":"Fiorini S, Rothvo\u00df T, Tiwary H (2012) Extended formulations for polygons. Discret Comput Geom 48(3):658\u2013668","journal-title":"Discret Comput Geom"},{"key":"243_CR14","unstructured":"Gay M (1985) Electronic mail distribution of linear programming test problems. Math Program Soc COAL Bull 13:10\u201312. http:\/\/www.netlib.org\/netlib\/lp"},{"key":"243_CR15","unstructured":"Glineur F (2000) Computational experiments with a linear approximation of second-order cone optimization. Image Technical Report 001, Facult\u00e9 Polytechnique de Mons"},{"issue":"1\u20132","key":"243_CR16","first-page":"5","volume":"41","author":"F Glineur","year":"2001","unstructured":"Glineur F (2001) Conic optimization: an elegenat framework for convex optimization. Belg J Oper Res Stat Comput Sci 41(1\u20132):5\u201328","journal-title":"Belg J Oper Res Stat Comput Sci"},{"key":"243_CR17","unstructured":"Gurobi Optimization, Inc (2013) Gurobi optimizer reference manual. http:\/\/www.gurobi.com"},{"key":"243_CR18","first-page":"2","volume":"85","author":"V Kaibel","year":"2011","unstructured":"Kaibel V (2011) Extended formulations in combinatorial optimization. Optima 85:2\u20137","journal-title":"Optima"},{"key":"243_CR19","first-page":"287","volume":"2011","author":"V Kaibel","year":"2011","unstructured":"Kaibel V, Pashkovich K (2011) Constructing extended formulations from reflection relations. Proc IPCO 2011:287\u2013300","journal-title":"Proc IPCO"},{"issue":"2","key":"243_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby R, Danna E, Gamrath G, Gleixner A, Heinz S, Lodi A, Mittelmann H, Ralphs T, Salvagnin D, Steffy D, Wolter K (2011) MIPLIB 2010. Math Program Comput 3(2):103\u2013163","journal-title":"Math Program Comput"},{"key":"243_CR21","unstructured":"Orlowski S, Pi\u00f3ro M, Tomaszewski A, Wess\u00e4ly R (2007) SNDlib 1.0\u2013survivable network design library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium"},{"issue":"3","key":"243_CR22","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"J Vielma","year":"2008","unstructured":"Vielma J, Ahmed S, Nemhauser GL (2008) A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs. INFORMS J Comput 20(3):438\u2013450","journal-title":"INFORMS J Comput"}],"updated-by":[{"DOI":"10.1007\/s10287-016-0269-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T00:00:00Z","timestamp":1482537600000}}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-015-0243-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-015-0243-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-015-0243-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:52Z","timestamp":1559117572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-015-0243-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,28]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s10287-015-0243-0","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,28]]}}}