[49] Jakub Kuzilek, Martin Hlosta, and Zdenek Zdrahal. Open university learning analytics dataset. Scientific data, 4:170171, 2017.
[50] Tai Le Quy, Arjun Roy, Vasileios Iosifidis, Wenbin Zhang, and Eirini Ntoutsi. A survey on datasets for fairness-aware machine learning. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, page e1452, 2022.
[51] Duan Li and Yacov Y. Haimes. Extension of Dynamic Programming to Nonseparable Dynamic Optimization Problems. Computers & Mathematics with Applications, 21(12-12):51-56, 1991.
[52] Jimmy Lin, Chudi Zhong, Diane Hu, Cynthia Rudin, and Margo Seltzer. Generalized and Scalable Optimal Sparse Decision Trees. In Proceedings of ICML-20, pages 6150–6160, 2020.
[53] Jacobus G. M. van der Linden, Mathijs M. de Weerdt, and Emir Demirović. Fair and Optimal Decision Trees: A Dynamic Programming Approach. In Advances in NeurIPS-22, pages 38899–38911, 2022.
[54] Charles X. Ling, Victor S. Sheng, and Qiang Yang. Test Strategies for Cost-Sensitive Decision Trees. IEEE Transactions on Knowledge and Data Engineering, 18(8):1055-1067, 2006.
[55] Susan Lomax and Sunil Vada. A Survey of Cost-Sensitive Decision Tree Induction Algorithms. ACM Computing Surveys, 45(2):1-35, 2013.
[56] Susan Lomax and Sunil Vadera. A Cost-Sensitive Decision Tree Learning Algorithm based on a Multi-Armed Bandit Framework. The Computer Journal, 60(7):941-956, 2017.
[57] Susan Elaine Lomax. Cost-Sensitive Decision Tree Learning using a Multi-Armed Bandit Framework. PhD thesis, University of Salford, 2013.
[58] Shlomi Maliah and Guy Shani. Using POMDPs for learning cost sensitive decision trees. Artificial Intelligence, 292:103400, 2021.
[59] O. L. Mangasarian and W. H. Wolberg. Cancer Diagnosis via Linear Programming. SIAM News, 23(5): 1-18, 1990.
[60] Ninareh Mehrabi, Fred Morstatter, Nripsuta Saxena, Kristina Lerman, and Aram Galstyan. A Survey on Bias and Fairness in Machine Learning. ACM Computing Surveys, 54(6):1-35, 2021.
[61] Fan Min and William Zhu. A Competition Strategy to Cost-Sensitive Decision Trees. In Proceedings of the International Conference on Rough Sets and Knowledge Technology (RSKT), pages 359-368, 2012.
[62] Sérgio Moro, Paulo Cortez, and Paulo Rita. A data-driven approach to predict the success of bank telemarketing. Decision Support Systems, 62:22-31, 2014.
[63] Géraldín Nanfack, Paul Temple, and Benoit Frénay. Constraint Enforcement on Decision Trees: A Survey. ACM Computing Surveys, 54(10):1-36, 2022.
[64] Nina Narodytska, Alexey Ignatiev, Filipe Pereira, and João Marques-Silva. Learning Optimal Decision Trees with SAT. In Proceedings of IJCAI-18, pages 1362–1368, 2018.
[65] Siegfried Nijssen and Elisa Fromont. Mining Optimal Decision Trees from Itemset Lattices. In Proceedings of SIGKDD-07, pages 530–539, 2007.
[66] Siegfried Nijssen and Elisa Fromont. Optimal constraint-based decision tree induction from itemset lattices. Data Mining and Knowledge Discovery, 21(1):9-51, 2010.
[67] Siegfried Nijssen and Vinasétan Ratheil. Time constrained DL8. 5 using Limited Discrepancy Search. In Proceedings of ECML-PKDD-22, pages 443–459, 2022.
[68] Steven W. Norton. Generating Better Decision Trees. In Proceedings of IJCAI-89, pages 800–805, 1989.
[69] Marlon Núñez. The Use of Background Knowledge in Decision Tree Induction. Machine Learning, 6(3): 231-250, 1991.
[70] Dino Pedreschi, Salvatore Ruggieri, and Franco Turini. Discrimination-aware Data Mining. In Proceedings of SIGKDD-08, pages 560–568, 2008.
[71] Rok Piltaver, Mitja Lustrek, Matjaž Gams, and Sandra Martinčić-Ipsić. What makes classification trees comprehensible? Expert Systems with Applications, 62:333-346, 2016.
[72] J. Ross Quinlan. Induction of Decision Trees. Machine Learning, 1(1):81-106, 1986.