[73] J. Ross Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc, San Francisco, CA, 1993.
[74] Cynthia Rudin. Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence, 1(5):206-215, 2019.
[75] André Schidler and Stefan Szeider. SAT-based Decision Tree Learning for Large Data Sets. In Proceedings AAAI-21, pages 3904–3912, 2021.
[76] Pouya Shati, Eldan Cohen, and Sheila A. McIlraith. SAT-based optimal classification trees for non-binary data. Constraints, 28(2):166-202, 2023.
[77] Beata Strack, Jonathan P DeShazo, Chris Gennings, Juan L Olmo, Sebastian Ventura, Krzysztof J Cios, and John N Clore. Impact of HbA1c measurement on hospital readmission rates: analysis of 70,000 clinical database patient records. BioMed research international, 2014.
[78] Jan Struyf and Sašo Džeroski. Clustering Trees with Instance Level Constraints. In Proceedings of ECML-07, pages 359–370, 2007.
[79] Shivaram Subramanian, Wei Sun, Youssef Drissi, and Markus Ettl. Constrained Prescriptive Trees via Column Generation. In Proceedings of AAAI-22, pages 4602–4610, 2022.
[80] Ming Tan. Cost-Sensitive Learning of Classification Knowledge and its Applications in Robotics. Machine Learning, 13(1):7-33, 1993.
[81] Turing Institute (Glasgow). Statlog (Vehicle Silhouettes) Dataset, 1987. URL https://archive.ics.uci.edu/ml/datasets/Statlog+%28Vehicle+Silhouettes%29.
[82] Peter D. Turney. Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm. Journal of artificial intelligence research, 2:369-409, 1995.
[83] Peter D. Turney. Types of Cost in Inductive Concept Learning. In Proceedings of the ICML'2000 Workshop on Cost-Sensitive Learning, pages 15-21, 2000.
[84] Hélene Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, and Pierre Schaus. Learning Optimal Decision Trees using Constraint Programming. Constraints, 25(3):226-250, 2020.
[85] Sicco Verwer and Yingqian Zhang. Learning decision trees with flexible constraints and objectives using integer optimization. In Proceedings of CPAIOR-17, pages 94–103, 2017.
[86] Sicco Verwer and Yingqian Zhang. Learning Optimal Classification Trees Using a Binary Linear Program Formulation. In Proceedings of AAAI-19, pages 1625–1632, 2019.
[87] Matheus Guedes Vilas Boas, Haroldo Gambini Santos, Luiz Henrique Campos Merschmann, and Greet Vanden Berghe. Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches. International Transactions in Operational Research, 28(5):2759-2781, 2021.
[88] Daniel Vos and Simco Verwer. Robust Optimal Classification Trees against Adversarial Examples. In Proceedings of AAAI-22, pages 8520–8528, 2022.
[89] Daniel Vos and Simco Verwer. Optimal Decision Tree Policies for Markov Decision Processes. arXiv preprint arXiv:2301.13185, 2023.
[90] Jingbo Wang, Yannan Li, and Chao Wang. Synthesizing Fair Decision Trees via Iterative Constraint Solving. In Proceedings of the International Conference on Computer Aided Verification, pages 364-385, 2022.
[91] Rui Xin, Chudi Zhong, Zhi Chen, Takuya Takagi, Margo Seltzer, and Cynthia Rudin. Exploring the Whole Rashomon Set of Sparse Decision Trees. In Advances in NeurIPS-22, pages 14071–14084, 2022.
[92] Zhengyuan Zhou, Susan Athey, and Stefan Wager. Offline Multi-Action Policy Learning: Generalization and Optimization. Operations Research, 71(1):148–183, 2022.
[93] Haoran Zhu, Pavankumar Murali, Dzung T. Phan, Lam M. Nguyen, and Jayant R. Kalagnanam. A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees. In Advances in NeurIPS-20, pages 1771–1781, 2020.
[94] Valentina Bayer Zubek and Thomas G. Dietterich. Pruning Improves Heuristic Search for Cost-Sensitive Learning. In Proceedings of ICML-02, pages 19–26, 2002.