{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:31:41Z","timestamp":1775716301610,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"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-015-0236-z","type":"journal-article","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T14:37:29Z","timestamp":1437403049000},"page":"195-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":83,"title":["Reformulation versus cutting-planes for robust optimization"],"prefix":"10.1007","volume":"13","author":[{"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"given":"Iain","family":"Dunning","sequence":"additional","affiliation":[]},{"given":"Miles","family":"Lubin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"236_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal A, El Ghaoui, L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton","DOI":"10.1515\/9781400831050"},{"issue":"1","key":"236_CR2","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\u201313","journal-title":"Oper Res Lett"},{"key":"236_CR3","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 88:411\u2013424","journal-title":"Math Program"},{"issue":"3","key":"236_CR4","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 (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501","journal-title":"SIAM Rev"},{"issue":"1","key":"236_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":"236_CR6","unstructured":"Bixby R, Ceria S, McZeal C, Savelsberg M (1998) An updated mixed integer programming library: MIPLIB 3.0. Optima 58:12\u201315"},{"issue":"2","key":"236_CR7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant O, Lemarchal C, Meurdesoif P, Michel S, Perrot N, Vanderbeck F (2008) Comparison of bundle and classical column generation. Math Program 113(2):299\u2013344","journal-title":"Math Program"},{"issue":"2","key":"236_CR8","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.orl.2013.12.012","volume":"42","author":"R Carvajal","year":"2014","unstructured":"Carvajal R, Ahmed S, Nemhauser G, Furman K, Goel V, Shao Y (2014) Using diversification, communication and parallelism to solve mixed-integer linear programs. Oper Res Lett 42(2):186\u2013189","journal-title":"Oper Res Lett"},{"key":"236_CR9","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:201\u2013213","journal-title":"Math Program"},{"key":"236_CR10","doi-asserted-by":"crossref","unstructured":"Efron B, Tibshirani RJ (1994) An introduction to the bootstrap, vol. 57. CRC Press, USA","DOI":"10.1007\/978-1-4899-4541-9"},{"key":"236_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s12532-012-0039-y","volume":"4","author":"M Fischetti","year":"2012","unstructured":"Fischetti M, Monaci M (2012) Cutting plane versus compact formulations for uncertain (integer) linear programs. Math Program Comput 4:239\u2013273","journal-title":"Math Program Comput"},{"issue":"3","key":"236_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"PJ Fleming","year":"1986","unstructured":"Fleming PJ, Wallace JJ (1986) How not to lie with statistics: the correct way to summarize benchmark results. Commun ACM 29(3):218\u2013221","journal-title":"Commun ACM"},{"key":"236_CR13","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay DM (1985) Electronic mail distribution of linear programming test problems. Math Program Soc COAL Newsl 13:10\u201312","journal-title":"Math Program Soc COAL Newsl"},{"issue":"4","key":"236_CR14","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1287\/opre.1110.0944","volume":"59","author":"J Goh","year":"2011","unstructured":"Goh J, Sim M (2011) Robust optimization made easy with rome. Oper Res 59(4):973\u2013985","journal-title":"Oper Res"},{"key":"236_CR15","unstructured":"Gurobi Optimization Inc. (2014) Gurobi optimizer reference manual. http:\/\/www.gurobi.com . Accessed 1 June 2014"},{"issue":"2","key":"236_CR16","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 RE, Danna E, Gamrath G, Gleixner AM, Heinz S, Lodi A, Mittelmann H, Ralphs T, Salvagnin D, Steffy DE, Wolter K (2011) MIPLIB 2010. Math Program Comput 3(2):103\u2013163","journal-title":"Math Program Comput"},{"issue":"1","key":"236_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00186-012-0390-9","volume":"76","author":"T Koch","year":"2012","unstructured":"Koch T, Ralphs T, Shinano Y (2012) Could we use a million cores to solve an integer program? Math Methods Oper Res 76(1):67\u201393","journal-title":"Math Methods Oper Res"},{"key":"236_CR18","unstructured":"Mittelmann H (2015) Benchmark of parallel LP solvers. http:\/\/plato.asu.edu\/ftp\/lpcom.html . Accessed 1 Mar 2015"},{"issue":"3","key":"236_CR19","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1080\/10556780802712889","volume":"24","author":"A Mutapcic","year":"2009","unstructured":"Mutapcic A, Boyd S (2009) Cutting-set methods for robust convex optimization with pessimizing oracles. Optim Methods Softw 24(3):381\u2013406","journal-title":"Optim Methods Softw"},{"issue":"3","key":"236_CR20","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich V, Fbin C, Ellison E, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic LPs with enhanced benders decomposition. Math Program Comput 4(3):211\u2013238","journal-title":"Math Program Comput"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-015-0236-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-015-0236-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-015-0236-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T12:58:33Z","timestamp":1566997113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-015-0236-z"}},"subtitle":["A computational study"],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s10287-015-0236-z","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,21]]}}}