[27] Dutch Central Bureau for Statistics. Dutch Census 2001 public use files (anonymized  $1\%$  samples from the microdata files). DANS, 2001. URL https://easy.dans.knaw.nl/ui/datasets/id/easy-dataset:32357.
[28] Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. Fairness Through Awareness. In Proceedings of ICTS '12, pages 214-226, 2012.
[29] Salah E. Elmaghraby. The Concept of "State" in Discrete Dynamic Programming. Journal of Mathematical Analysis and Applications, 29(3):523-557, 1970.
[30] FICO, Google, Imperial College London, MIT, University of Oxford, UC Irvine, and UC Berkeley. Explainable Machine Learning Challenge, 2018. URL https://community.fico.com/s/explainable-machine-learning-challenge.
[31] Philip J. Fleming and John J. Wallace. How not to lie with statistics: the correct way to summarize benchmark results. Communications of the ACM, 29(3):218-221, 1986.
[32] Alberto Freitas, Altamiro Costa-Pereira, and Pavel Brazil. Cost-Sensitive Decision Trees Applied to Medical Data. In Proceedings of the International Conference on Data Warehousing and Knowledge Discovery (DaWaK-2007), pages 303-312, 2007.
[33] Gurobi Optimization LLC. Gurobi Optimizer Reference Manual, 2022. URL https://www.gurobi.com.
[34] Hao Hu, Mohamed Siala, Emmanuel Hebrard, and Marie-José Huguet. Learning Optimal Decision Trees with MaxSAT and its Integration in AdaBoost. In IJCAI-PRICAI 2020, pages 1170–1176, 2020.
[35] Qinghua Hu, Xunjian Che, Lei Zhang, David Zhang, Maozu Guo, and Daren Yu. Rank Entropy-Based Decision Trees for Monotonic Classification. IEEE Transactions on Knowledge and Data Engineering, 24 (11):2052-2064, 2011.
[36] Xiyang Hu, Cynthia Rudin, and Margo Seltzer. Optimal Sparse Decision Trees. In Advances in NeurIPS-19, pages 7267-7275, 2019.
[37] Kaixun Hua, Jiayang Ren, and Yankai Cao. A Scalable Deterministic Global Optimization Algorithm for Training Optimal Decision Tree. In Advances in NeurIPS-22, pages 8347–8359, 2022.
[38] Laurent Hyafil and Ronald L. Rivest. Constructing optimal binary decision trees is NP-complete. Information processing letters, 5(1):15-17, 1976.
[39] International Warfarin Pharmacogenetics Consortium. Estimation of the Warfarin Dose with Clinical and Pharmacogenetic Data. New England Journal of Medicine, 360(8):753-764, 2009.
[40] Yacine Izza, Alexey Ignatiev, and Joao Marques-Silva. On Tackling Explanation Redundancy in Decision Trees. Journal of Artificial Intelligence Research, 75:261-321, 2022.
[41] Andras Janosi, William Steinbrunn, Matthias Pfisterer, and Robert Detrano. Heart Cleveland Dataset, 1988. URL https://archive.ics.uci.edu/ml/datasets/heart+disease.
[42] Mikoláš Janota and António Morgado. SAT-Based Encodings for Optimal Decision Trees with Explicit Paths. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT 2020), pages 501-518, 2020.
[43] Nathanael Jo, Sina Aghaei, Andres Gomez, and Phebe Vayanos. Learning Optimal Prescriptive Trees from Observational Data. arXiv preprint arXiv:2108.13628, 2021.
[44] Nathanael Jo, Sina Aghaei, Jack Benson, Andres Gomez, and Phebe Vayanos. Learning Optimal Fair Classification Trees. arXiv preprint arXiv:2201.09932, 2022.
[45] Nathan Kallus. Recursive Partitioning for Personalization using Observational Data. In Proceedings of ICML-17, pages 1789–1798, 2017.
[46] Faisal Kamiran and Toon Calders. Classifying without discriminating. In 2nd International Conference on Computer, Control and Communication, pages 333-338, 2009.
[47] Faisal Kamiran, Toon Calders, and Mykola Pechenizkiy. Discrimination Aware Decision Tree Learning. In Proceedings of ICDM-10, pages 869–874, 2010.
[48] Richard M. Karp and Michael Held. Finite-State Processes and Dynamic Programming. SIAM Journal on Applied Mathematics, 15(3):693-718, 1967.