Holistic Prescriptive Analytics for Continuous and Constrained Optimization Problems

References

• Baardman L, Levin I, Perakis G, Singhvi D (2017) Leveraging comparables for new product sales forecasting. Preprint, submitted December 14, https://dx.doi.org/10.2139/ssrn.3086237.Google Scholar
• Bengio Y, Le Roux N, Vincent P, Delalleau O, Marcotte P (2006) Convex neural networks. Adv. Neural Inform. Processing Systems 18:123.Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization, vol. 28 (Princeton University Press, Woodstock, Oxfordshire, UK).Google Scholar
• Bertsimas D, Dunn J (2017) Optimal classification trees. Machine Learn. 106(7):1039–1082.Google Scholar
• Bertsimas D, Dunn J (2019) Machine Learning Under a Modern Optimization Lens (Dynamic Ideas, Boston).Google Scholar
• Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Bertsimas D, Mundru N (2021) Sparse convex regression. INFORMS J. Comput. 33(1):262–279.Link, Google Scholar
• Bertsimas D, Dunn J, Mundru N (2019) Optimal prescriptive trees. INFORMS J. Optim. 1(2):164–183.Link, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018) Data-driven robust optimization. Math. Programming 167(2):235–292.Google Scholar
• Bertsimas D, Orfanoudaki A, Wiberg H (2021) Interpretable clustering: An optimization approach. Machine Learn. 110:89–138.Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer Science & Business Media, New York).Google Scholar
• Breiman L, Friedman J, Stone C, Olshen R (1984) Classification and Regression Trees, The Wadsworth and Brooks-Cole Statistics-Probability Series (Taylor & Francis, London).Google Scholar
• Chen T, Guestrin C (2016) Xgboost: A scalable tree boosting system. Proc. 22nd ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, 785–794.Google Scholar
• Demirović E, Stuckey PJ, Bailey J, Chan J, Leckie C, Ramamohanarao K, Guns T (2019a) An investigation into prediction+ optimisation for the knapsack problem. Proc. Internat. Conf. Integration Constraint Programming Artificial Intelligence Oper. Res. (Springer), 241–257.Google Scholar
• Demirović E, Stuckey PJ, Bailey J, Chan J, Leckie C, Ramamohanarao K, Guns T (2019b) Predict + optimise with ranking objectives: Exhaustively learning linear functions. Internat. Joint Conf. Artificial Intelligence, 1078–1085.Google Scholar
• Demirović E, Stuckey PJ, Guns T, Bailey J, Leckie C, Ramamohanarao K, Chan J, et al. (2020) Dynamic programming for predict + optimise. Proc. Conf. AAAI Artificial Intelligence (AAAI, New York), 34:1444–1451.Google Scholar
• Elmachtoub AN, Grigas P (2017) Smart “predict, then optimize.” Preprint, submitted October 22, https://arxiv.org/abs/1710.08005.Google Scholar
• Kallus N, Pennicooke B, Santacatterina M (2018) More robust estimation of sample average treatment effects using kernel optimal matching in an observational study of spine surgical interventions. Preprint, submitted November 10, https://arxiv.org/abs/1811.04274.Google Scholar
• LeCun Y, Bengio Y, Hinton G (2015) Deep learning. Nature 521(7553):436–444.Google Scholar
• Perakis G, Singhvi D, Skali Lami O, Mangal A, Poninghaus S, Borenstein A, Lua JW (2022) Ancillary services in targeted advertising: From prediction to prescription. Manufacturing Service Oper. Management. Forthcoming.Google Scholar
• Tulabandhula T, Rudin C (2013) Machine learning with operational costs. J. Mach. Learn. Res. 14(1):1989–2028.Google Scholar
• Wilder B, Dilkina B, Tambe M (2019) Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. Proc. Conf. AAAI Artificial Intelligence 33:1658–1665.Google Scholar
• Zou H, Hastie T (2005) Regularization and variable selection via the elastic net. J. Roy. Statist. Soc. Ser. B Statist. Methodology 67(2):301–320.Google Scholar