A Prescriptive Machine Learning Approach to Mixed-Integer Convex Optimization

References

• Alvarez AM, Louveaux Q, Wehenkel L (2017) A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1):185–195.Link, Google Scholar
• Amram M, Dunn J, Zhuo YD (2022) Optimal policy trees. Machine Learning 111:2741–2768.Crossref, Google Scholar
• Balcan MF, Sandholm T, Vitercik E (2020a) Learning to optimize computational resources: Frugal training with generalization guarantees. Proc. Thirty-Fourth AAAI Conf. Artificial Intelligence AAAI 2020 (AAAI Press, Washington, DC).Crossref, Google Scholar
• Balcan MF, Sandholm T, Vitercik E (2020b) Refined bounds for algorithm configuration: The knife-edge of dual class approximability. Daumé H, Singh A, eds. Proc. 37th Internat. Conf. Machine Learning, Proceedings of Machine Learning Research, vol. 119 (PMLR, Cambridge, MA), 580–590.Google Scholar
• Balcan MF, Prasad S, Sandholm T, Vitercik E (2022) Structural analysis of branch-and-cut and the learnability of Gomory mixed integer cuts. Preprint, submitted April 15, https://arxiv.org/abs/2204.07312.Google Scholar
• Balcan MF, DeBlasio D, Dick T, Kingsford C, Sandholm T, Vitercik E (2021) How much data are sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design. Proc. 53rd Annu. ACM SIGACT Sympos. Theory Comput. STOC 2021 (Association for Computing Machinery, New York), 919–932.Google Scholar
• Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 290(2):405–421.Crossref, Google Scholar
• Bertsimas D, Dunn J (2017) Optimal classification trees. Machine Learning 106(1):1039–1082.Crossref, Google Scholar
• Bertsimas D, Dunn J (2019) Machine Learning Under a Modern Optimization Lens (Dynamic Ideas, Charlestown, MA).Google Scholar
• Bertsimas D, Stellato B (2021) The voice of optimization. Machine Learning 110:249–277.Crossref, Google Scholar
• Bertsimas D, Stellato B (2022) Online mixed-integer optimization in milliseconds. INFORMS J. Comput. 34(4):2229–2248.Link, Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization over Integers (Dynamic Ideas, Charlestown, MA).Google Scholar
• Biggs M, Sun W, Ettl M (2021) Model distillation for revenue optimization: Interpretable personalized pricing. Meila M, Zhang T, eds. Proc. 38th Internat. Conf. Machine Learning, Proceedings of Machine Learning Research, vol. 139 (PMLR, Cambridge, MA), 946–956.Google Scholar
• Breiman L, Friedman J, Stone C, Olshen R (1984) Classification and Regression Trees (Chapman and Hall/CRC, New York).Google Scholar
• Carrion M, Arroyo J (2006) A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Systems 21(3):1371–1378.Crossref, Google Scholar
• Carrizosa E, Molero-Río C, Romero Morales D (2021) Mathematical optimization in classification and regression trees. TOP 29(1):5–33.Crossref, Google Scholar
• Cauligi A, Culbertson P, Schmerling E, Schwager M, Stellato B, Pavone M (2022) CoCo: Online mixed-integer control via supervised learning. IEEE Robotics Automation Lett. 7(2):1447–1454.Crossref, Google Scholar
• Gleixner A, Hendel G, Gamrath G, Achterberg T, Bastubbe M, Berthold T, Christophel PM, et al. (2021) MIPLIB 2017: Data-driven compilation of the 6th Mixed-Integer Programming Library. Math. Program. Comput. 13:443–490.Crossref, Google Scholar
• Gurobi Optimization LLC (2022) Gurobi optimizer reference manual. Accessed May 1, https://www.gurobi.com.Google Scholar
• Hüllermeier E (2021) Prescriptive machine learning for automated decision making: Challenges and opportunities. Preprint, submitted December 15, https://arxiv.org/abs/2112.08268.Google Scholar
• Hutter F, Hoos HH, Leyton-Brown K (2011) Sequential model-based optimization for general algorithm configuration. LION’05 Proc. Internat. Conf. Learning Intelligent Optim. (Springer-Verlag, Berlin, Heidelberg), 507–523.Google Scholar
• Interpretable AI (2022) Interpretable AI documentation. Accessed May 1, 2023, https://www.interpretable.ai.Google Scholar
• Khalil EB, Bodic PL, Song L, Nemhauser G, Dilkina B (2016) Learning to branch in mixed integer programming. Proc. Thirtieth AAAI Conf. Artificial Intelligence AAAI’16 (AAAI Press, Washington, DC), 724–731.Google Scholar
• Lehmann D, Müller R, Sandholm T (2006) Combinatorial Auctions (MIT Press, Cambridge, MA).Google Scholar
• Lodi A, Zarpellon G (2017) On learning and branching: A survey. TOP 25:207–236.Crossref, Google Scholar
• Miroslav D, Langford J, Li L (2011) Doubly robust policy evaluation and learning. Proc. 28th Internat. Conf. Machine Learning (International Conference on Machine Learning), 1097–1104. https://dl.acm.org/doi/10.5555/3104482.3104620.Google Scholar
• Nemhauser G, Wolsey L (1988) Integer and Combinatorial Optimization (John Wiley and Sons, Ltd., Hoboken, NJ).Crossref, Google Scholar
• Pessach D, Singer G, Avrahami D, Chalutz Ben-Gal H, Shmueli E, Ben-Gal I (2020) Employees recruitment: A prescriptive analytics approach via machine learning and mathematical programming. Decision Support Systems 134:113290.Crossref, Google Scholar
• Takapouia R, Moehleb N, Boyd S, Bemporad A (2017) A simple effective heuristic for embedded mixed-integer quadratic programming. Internat. J. Control 1–11. https://doi.org/10.1080/00207179.2017.1316016.Google Scholar
• Zhao Y, Zeng D, Rush AJ, Kosorok MR (2012) Estimating individualized treatment rules using outcome weighted learning. J. Amer. Statist. Assoc. 107:1106–1118.Crossref, Google Scholar