{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T09:31:13Z","timestamp":1790847073520,"version":"4.1.0"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006919","name":"Massachusetts Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006919","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Data-driven decision-making has garnered growing interest as a result of the increasing availability of data in recent years. With that growth many opportunities and challenges have sprung up in the areas of predictive and prescriptive analytics. Often, optimization can play an important role in tackling these issues. In this paper, we review some recent advances that highlight the difference that optimization can make in data-driven decision-making. We discuss some of our contributions that aim to advance both predictive and prescriptive models. First, we describe how we can optimally estimate clustered models that result in improved predictions. Next, we consider how we can optimize over objective functions that arise from tree ensemble models in order to obtain better prescriptions. Finally, we discuss how we can learn optimal solutions directly from the data allowing for prescriptions without the need for predictions. For all these new methods, we stress the need for good performance but also the scalability to large heterogeneous datasets. \n\n<\/jats:p>","DOI":"10.1007\/s10107-022-01874-9","type":"journal-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T16:49:39Z","timestamp":1660236579000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["The role of optimization in some recent advances in data-driven decision-making"],"prefix":"10.1007","volume":"200","author":[{"given":"Lennart","family":"Baardman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rares","family":"Cristian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0888-9030","authenticated-orcid":false,"given":"Georgia","family":"Perakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Divya","family":"Singhvi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omar","family":"Skali Lami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leann","family":"Thayaparan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"1874_CR1","doi-asserted-by":"crossref","unstructured":"Baardman, L., Levin, I., Perakis, G., Singhvi, D.: Leveraging comparables for new product sales forecasting. Available at SSRN 3086237 (2019)","DOI":"10.1111\/poms.12963"},{"key":"1874_CR2","doi-asserted-by":"crossref","unstructured":"Perakis, G., Singhvi, D., Skali\u00a0Lami, O., Borenstein, A., Lua, J.W., Mangal, A., Poninghaus, S.: Ancillary services in targeted advertising: from prediction to prescription. Manufacturing & Service Operations Management (2021)","DOI":"10.2139\/ssrn.4119066"},{"key":"1874_CR3","unstructured":"Boroujeni, S., Panchamgam, K., Perakis, G., Thayaparan, L.: Motem: Method for optimizing over tree ensemble models. Available at SSRN 3972341 (2021)"},{"key":"1874_CR4","unstructured":"Cristian, R., Perakis, G.: Learning near optimal decisions: From saa to robust optimization. Working Paper (2021)"},{"issue":"5","key":"1874_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/mnsc.15.5.215","volume":"15","author":"FM Bass","year":"1969","unstructured":"Bass, F.M.: A new product growth for model consumer durables. Manage. Sci. 15(5), 215\u2013227 (1969)","journal-title":"Manage. Sci."},{"key":"1874_CR6","doi-asserted-by":"crossref","unstructured":"Bass, F.M.: Comments on \u201ca new product growth for model consumer durables the bass model.\u201d Manage. Sci. 50(12), 1833\u20131840 (2004)","DOI":"10.1287\/mnsc.1040.0300"},{"key":"1874_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.retrec.2015.06.003","volume":"50","author":"J Massiani","year":"2015","unstructured":"Massiani, J., Gohs, A.: The choice of bass model coefficients to forecast diffusion for innovative products: An empirical investigation for new automotive technologies. Res. Transp. Econ. 50, 17\u201328 (2015)","journal-title":"Res. Transp. Econ."},{"issue":"3","key":"1874_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2196\/jmir.4973","volume":"18","author":"EW Ford","year":"2016","unstructured":"Ford, E.W., Hesse, B.W., Huerta, T.R.: Personal health record use in the united states: Forecasting future adoption levels. J. Med. Internet Res. 18(3), 73 (2016)","journal-title":"J. Med. Internet Res."},{"key":"1874_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jbusres.2017.01.010","volume":"74","author":"Z Fan","year":"2017","unstructured":"Fan, Z., Che, Y., Chen, Z.: Product sales forecasting using online reviews and historical sales data: A method combining the bass model and sentiment analysis. J. Bus. Res. 74, 90\u2013100 (2017)","journal-title":"J. Bus. Res."},{"issue":"4","key":"1874_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02265317","volume":"22","author":"H Sp\u00e4th","year":"1979","unstructured":"Sp\u00e4th, H.: Algorithm 39: Clusterwise linear regression. Computing 22(4), 367\u2013373 (1979)","journal-title":"Computing"},{"issue":"1","key":"1874_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1509\/jmkr.39.1.99.18932","volume":"39","author":"MJ Brusco","year":"2002","unstructured":"Brusco, M.J., Cradit, J.D., Stahl, S.: A simulated annealing heuristic for a bicriterion partitioning problem in market segmentation. J. Mark. Res. 39(1), 99\u2013109 (2002)","journal-title":"J. Mark. Res."},{"key":"1874_CR12","unstructured":"Chirico, P.: A clusterwise regression method for the prediction of the disposal income in municipalities. In: Classification and Data Mining"},{"issue":"1","key":"1874_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1287\/msom.2017.0691","volume":"21","author":"K Hu","year":"2019","unstructured":"Hu, K., Acimovic, J., Erize, F., Thomas, D.J., Van Mieghem, J.A.: Forecasting product life cycle curves: Practical approach and empirical analysis. Manuf. Serv. Opera. Manag. 21(1), 66\u201385 (2019)","journal-title":"Manuf. Serv. Opera. Manag."},{"key":"1874_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.atmosres.2017.01.003","volume":"188","author":"AM Bagirov","year":"2017","unstructured":"Bagirov, A.M., Mahmood, A., Barton, A.: Prediction of monthly rainfall in victoria, australia: Clusterwise linear regression approach. Atmos. Res. 188, 20\u201329 (2017)","journal-title":"Atmos. Res."},{"issue":"4","key":"1874_CR15","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/BF02296405","volume":"54","author":"WS DeSarbo","year":"1989","unstructured":"DeSarbo, W.S., Oliver, R.L., Rangaswamy, A.: A simulated annealing methodology for clusterwise linear regression. Psychometrika 54(4), 707\u2013736 (1989)","journal-title":"Psychometrika"},{"issue":"2","key":"1874_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01897167","volume":"5","author":"WS DeSarbo","year":"1988","unstructured":"DeSarbo, W.S., Cron, W.L.: A maximum likelihood methodology for clusterwise linear regression. J. Classif. 5(2), 249\u2013282 (1988)","journal-title":"J. Classif."},{"issue":"4","key":"1874_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1020779827503","volume":"12","author":"K Viele","year":"2002","unstructured":"Viele, K., Tong, B.: Modeling with mixtures of linear regressions. Stat. Comput. 12(4), 315\u2013330 (2002)","journal-title":"Stat. Comput."},{"issue":"3","key":"1874_CR18","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/S0377-2217(98)00052-6","volume":"116","author":"K Lau","year":"1999","unstructured":"Lau, K., Leung, P., Tse, K.: A mathematical programming approach to clusterwise regression model and its extensions. Eur. J. Oper. Res. 116(3), 640\u2013652 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1874_CR19","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1287\/opre.1060.0360","volume":"55","author":"D Bertsimas","year":"2007","unstructured":"Bertsimas, D., Shioda, R.: Classification and regression via integer optimization. Oper. Res. 55(2), 252\u2013271 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"1874_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ejor.2011.01.016","volume":"212","author":"RA Carbonneau","year":"2011","unstructured":"Carbonneau, R.A., Caporossi, G., Hansen, P.: Globally optimal clusterwise regression by mixed logical-quadratic programming. Eur. J. Oper. Res. 212(1), 213\u2013222 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"1874_CR21","doi-asserted-by":"publisher","first-page":"2748","DOI":"10.1016\/j.cor.2012.02.007","volume":"39","author":"RA Carbonneau","year":"2012","unstructured":"Carbonneau, R.A., Caporossi, G., Hansen, P.: Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression. Computers & Operations Research 39(11), 2748\u20132762 (2012)","journal-title":"Computers & Operations Research"},{"key":"1874_CR22","doi-asserted-by":"crossref","unstructured":"Park, Y.W., Jiang, Y., Klabjan, D., Williams, L.: Algorithms for generalized cluster wise linear regression. INFORMS J. Comput. 29(2), 301\u2013317 (2017)","DOI":"10.1287\/ijoc.2016.0729"},{"issue":"4","key":"1874_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1177\/002224378902600401","volume":"26","author":"WA Kamakura","year":"1989","unstructured":"Kamakura, W.A., Russell, G.J.: A probabilistic choice model for market segmentation and elasticity structure. J. Mark. Res. 26(4), 379\u2013390 (1989)","journal-title":"J. Mark. Res."},{"issue":"5","key":"1874_CR24","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","volume":"1","author":"N Megiddo","year":"1982","unstructured":"Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1(5), 194\u2013197 (1982)","journal-title":"Oper. Res. Lett."},{"key":"1874_CR25","unstructured":"Perakis, G., Singhvi, D., Skali\u00a0Lami, O.: Extended sampled tree ensembles for classification and regression. Available at SSRN: https:\/\/ssrn.com\/abstract=3505431 (2021)"},{"key":"1874_CR26","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: A scalable tree boosting system. In: Proceedings of the 22nd Acm Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794. ACM (2016)","DOI":"10.1145\/2939672.2939785"},{"issue":"2","key":"1874_CR27","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ijforecast.2013.07.005","volume":"30","author":"S Ben Taieb","year":"2014","unstructured":"Ben Taieb, S., Hyndman, R.J.: A gradient boosting approach to the kaggle load forecasting competition. Int. J. Forecast. 30(2), 382\u2013394 (2014). https:\/\/doi.org\/10.1016\/j.ijforecast.2013.07.005","journal-title":"Int. J. Forecast."},{"issue":"2","key":"1874_CR28","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ijforecast.2020.07.007","volume":"37","author":"CS Bojer","year":"2021","unstructured":"Bojer, C.S., Meldgaard, J.P.: Kaggle forecasting competitions: An overlooked learning opportunity. Int. J. Forecast. 37(2), 587\u2013603 (2021)","journal-title":"Int. J. Forecast."},{"issue":"1","key":"1874_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"issue":"3","key":"1874_CR30","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., M\u00fcller, K.-R.: Soft margins for adaboost. Mach. Learn. 42(3), 287\u2013320 (2001)","journal-title":"Mach. Learn."},{"key":"1874_CR31","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., Liu, T.-Y.: Lightgbm: A highly efficient gradient boosting decision tree. Adv. Neural. Inf. Process. Syst. 30, 3146\u20133154 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1874_CR32","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and regression trees (1984)"},{"issue":"5","key":"1874_CR33","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1287\/mnsc.2015.2363","volume":"62","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., O\u2019Hair, A., Relyea, S., Silberholz, J.: An analytics approach to designing combination chemotherapy regimens for cancer. Manage. Sci. 62(5), 1511\u20131531 (2016)","journal-title":"Manage. Sci."},{"issue":"1","key":"1874_CR34","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/mnsc.2017.2926","volume":"65","author":"L Baardman","year":"2019","unstructured":"Baardman, L., Cohen, M.C., Panchamgam, K., Perakis, G., Segev, D.: Scheduling promotion vehicles to boost profits. Manage. Sci. 65(1), 50\u201370 (2019)","journal-title":"Manage. Sci."},{"key":"1874_CR35","unstructured":"Mi\u0161i\u0107, V.V.: Data, models and decisions for large-scale stochastic optimization problems. PhD thesis, Massachusetts Institute of Technology (2016)"},{"issue":"3","key":"1874_CR36","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1287\/opre.2018.1825","volume":"67","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Mi\u0161i\u0107, V.V.: Exact first-choice product line optimization. Oper. Res. 67(3), 651\u2013670 (2019)","journal-title":"Oper. Res."},{"key":"1874_CR37","doi-asserted-by":"crossref","unstructured":"Anderson, R., Huchette, J., Ma, W., Tjandraatmadja, C., Vielma, J.P.: Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1), 3\u201339 (2020)","DOI":"10.1007\/s10107-020-01474-5"},{"key":"1874_CR38","unstructured":"Bunel, R., Turkaslan, I., Torr, P.H., Kohli, P., Kumar, M.P.: A unified view of piecewise linear neural network verification. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 4795\u20134804 (2018)"},{"key":"1874_CR39","doi-asserted-by":"crossref","unstructured":"Cheng, C.-H., N\u00fchrenberg, G., Ruess, H.: Maximum resilience of artificial neural networks. In: International Symposium on Automated Technology for Verification and Analysis, pp. 251\u2013268. Springer (2017)","DOI":"10.1007\/978-3-319-68167-2_18"},{"issue":"3","key":"1874_CR40","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s10601-018-9285-6","volume":"23","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Jo, J.: Deep neural networks and mixed integer linear optimization. Constraints 23(3), 296\u2013309 (2018)","journal-title":"Constraints"},{"key":"1874_CR41","unstructured":"Kumar, A., Serra, T., Ramalingam, S.: Equivalent and approximate transformations of deep neural networks. arXiv preprint arXiv:1905.11428 (2019)"},{"key":"1874_CR42","unstructured":"Tjeng, V., Xiao, K., Tedrake, R.: Evaluating robustness of neural networks with mixed integer programming. arXiv preprint arXiv:1711.07356 (2017)"},{"issue":"1","key":"1874_CR43","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1287\/msom.1090.0264","volume":"12","author":"O Besbes","year":"2010","unstructured":"Besbes, O., Phillips, R., Zeevi, A.: Testing the validity of a demand model: An operations perspective. Manuf. Serv. Opera. Manag. 12(1), 162\u2013183 (2010)","journal-title":"Manuf. Serv. Opera. Manag."},{"key":"1874_CR44","unstructured":"Kallus, N., Mao, X.: Stochastic optimization forests. ArXiv arXiv:2008.07473 (2020)"},{"key":"1874_CR45","doi-asserted-by":"crossref","unstructured":"Biggs, M., Hariss, R., Perakis, G.: Optimizing objective functions determined from random forests. Available at SSRN 2986630 (2017)","DOI":"10.2139\/ssrn.2986630"},{"issue":"5","key":"1874_CR46","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1287\/opre.2019.1928","volume":"68","author":"VV Mi\u0161i\u0107","year":"2020","unstructured":"Mi\u0161i\u0107, V.V.: Optimization of tree ensembles. Oper. Res. 68(5), 1605\u20131624 (2020)","journal-title":"Oper. Res."},{"issue":"1","key":"1874_CR47","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/msom.2015.0561","volume":"18","author":"KJ Ferreira","year":"2016","unstructured":"Ferreira, K.J., Lee, B.H.A., Simchi-Levi, D.: Analytics for an online retailer: Demand forecasting and price optimization. Manuf. Serv. Opera. Manag. 18(1), 69\u201388 (2016)","journal-title":"Manuf. Serv. Opera. Manag."},{"key":"1874_CR48","unstructured":"Cortez, P.: Viticulture commission of the vinho verde region (cvrvv). University of Minho, Guimar\u00e3es, Portugal. Retrieved 15, 2020 (2009)"},{"key":"1874_CR49","unstructured":"Kao, Y.-h., Roy, B., Yan, X.: Directed regression. Advances in Neural Information Processing Systems 22 (2009)"},{"key":"1874_CR50","unstructured":"Amos, B., Kolter, J.Z.: Optnet: Differentiable optimization as a layer in neural networks. In: International Conference on Machine Learning, pp. 136\u2013145. PMLR (2017)"},{"key":"1874_CR51","doi-asserted-by":"crossref","unstructured":"Wilder, B., Dilkina, B., Tambe, M.: Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1658\u20131665 (2019)","DOI":"10.1609\/aaai.v33i01.33011658"},{"key":"1874_CR52","doi-asserted-by":"crossref","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart \u201cpredict, then optimize\u201d. Manage. Sci. 68(1), 9\u201326 (2022)","DOI":"10.1287\/mnsc.2020.3922"},{"key":"1874_CR53","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/opre.2018.1757","volume":"67","author":"G-Y Ban","year":"2019","unstructured":"Ban, G.-Y., Rudin, C.: The big data newsvendor: Practical insights from machine learning. Oper. Res. 67, 90\u2013108 (2019)","journal-title":"Oper. Res."},{"issue":"1","key":"1874_CR54","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1287\/opre.2020.2069","volume":"70","author":"D Bertsimas","year":"2022","unstructured":"Bertsimas, D., Koduri, N.: Data-driven optimization: A reproducing kernel hilbert space approach. Oper. Res. 70(1), 454\u2013471 (2022)","journal-title":"Oper. Res."},{"key":"1874_CR55","unstructured":"Mandi, J., Guns, T.: Interior point solving for lp-based prediction+optimisation. Adv. Neural. Inf. Process. Syst. 33, 7272\u20137282 (2020). arXiv:2010.13943"},{"key":"1874_CR56","unstructured":"Vlastelica, M.P., Paulus, A., Musil, V., Martius, G., Rolinek, M.: Differentiation of blackbox combinatorial solvers. ArXiv arXiv:1912.02175 (2020)"},{"key":"1874_CR57","unstructured":"Berthet, Q., Blondel, M., Teboul, O., Cuturi, M., Vert, J.-P., Bach, F.: Learning with differentiable perturbed optimizers. Adv. Neural. Inf. Process. Syst. 33, 9508\u20139519 (2020). arXiv:2002.08676"},{"key":"1874_CR58","doi-asserted-by":"crossref","unstructured":"Kotary, J., Fioretto, F., Van\u00a0Hentenryck, P., Wilder, B.: End-to-end constrained optimization learning: A survey. CoRR arXiv:2103.16378 (2021)","DOI":"10.24963\/ijcai.2021\/610"},{"issue":"1","key":"1874_CR59","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.2013.0598","volume":"39","author":"J-Y Audibert","year":"2014","unstructured":"Audibert, J.-Y., Bubeck, S., Lugosi, G.: Regret in online combinatorial optimization. Math. Oper. Res. 39(1), 31\u201345 (2014). https:\/\/doi.org\/10.1287\/moor.2013.0598","journal-title":"Math. Oper. Res."},{"key":"1874_CR60","unstructured":"Balkanski, E., Singer, Y.: The sample complexity of optimizing a convex function. In: Conference on Learning Theory, pp. 275\u2013301. PMLR (2017)"},{"key":"1874_CR61","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E.: Introduction to online convex optimization. Found. Trends Optim. 2, 157\u2013325 (2016)","journal-title":"Found. Trends Optim."},{"key":"1874_CR62","unstructured":"Nemirovski\u012d, A.S., El\u00a0Ghaoui, L., Ben-Tal, A.: Robust Optimization (Princeton Series in Applied Mathematics). Princeton University Press"},{"key":"1874_CR63","unstructured":"Bertsimas, D., den Hertog, D.: Robust and adaptive optimization. Dynamic Ideas LLC 958 (2020)"},{"key":"1874_CR64","doi-asserted-by":"publisher","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011). https:\/\/doi.org\/10.1137\/080734510","DOI":"10.1137\/080734510"},{"issue":"5","key":"1874_CR65","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A.L.: Technical note-convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"issue":"3","key":"1874_CR66","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88(3), 411\u2013424 (2000)","journal-title":"Math. Program."},{"key":"1874_CR67","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, 35\u201353 (2004). https:\/\/doi.org\/10.1287\/opre.1030.0065","journal-title":"Oper. Res."},{"key":"1874_CR68","doi-asserted-by":"publisher","unstructured":"Bertsimas, D., Gupta, V., Kallus, N.: Data-driven robust optimization. Math. Program. 167(2), 235\u2013292 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1125-8","DOI":"10.1007\/s10107-017-1125-8"},{"key":"1874_CR69","unstructured":"Bertsimas, D., McCord, C., Sturt, B.: Dynamic optimization with side information. arXiv preprint arXiv:1907.07307 (2019)"},{"key":"1874_CR70","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Van\u00a0Parys, B.: Bootstrap robust prescriptive analytics. Mathematical Programming, 1\u201340 (2021)","DOI":"10.1007\/s10107-021-01679-2"},{"key":"1874_CR71","unstructured":"Kannan, R., Bayraksan, G., Luedtke, J.R.: Residuals-based distributionally robust optimization with covariate information. arXiv preprint arXiv:2012.01088 (2020)"},{"issue":"2","key":"1874_CR72","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1874_CR73","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1287\/mnsc.2018.3253","volume":"66","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Kallus, N.: From predictive to prescriptive analytics. Manage. Sci. 66(3), 1025\u20131044 (2020)","journal-title":"Manage. Sci."},{"issue":"2","key":"1874_CR74","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoo.2018.0005","volume":"1","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Dunn, J., Mundru, N.: Optimal prescriptive trees. INFORMS J. Optim. 1(2), 164\u2013183 (2019)","journal-title":"Optimal prescriptive trees. INFORMS J. Optim."},{"issue":"3","key":"1874_CR75","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1287\/mnsc.2020.3867","volume":"68","author":"PM Notz","year":"2022","unstructured":"Notz, P.M., Pibernik, R.: Prescriptive analytics for flexible capacity management. Manage. Sci. 68(3), 1756\u20131775 (2022)","journal-title":"Manage. Sci."},{"key":"1874_CR76","unstructured":"Gao, R., Yang, J., Zhang, L.: Optimal robust policy for feature-based newsvendor"},{"key":"1874_CR77","unstructured":"Bousquet, O., Elisseeff, A.: Algorithmic stability and generalization performance. Advances in Neural Information Processing Systems 13 (2000)"},{"key":"1874_CR78","doi-asserted-by":"crossref","unstructured":"Verma, S., Zhang, Z.-L.: Stability and generalization of graph convolutional neural networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1539\u20131548 (2019)","DOI":"10.1145\/3292500.3330956"},{"issue":"3","key":"1874_CR79","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10957-016-0966-2","volume":"170","author":"L Coroianu","year":"2016","unstructured":"Coroianu, L.: Best lipschitz constants of solutions of quadratic programs. J. Optim. Theory Appl. 170(3), 853\u2013875 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0966-2","journal-title":"J. Optim. Theory Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01874-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01874-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01874-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T23:05:13Z","timestamp":1684451113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01874-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,11]]},"references-count":79,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1874"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01874-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,11]]},"assertion":[{"value":"17 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}