{"total":28,"rows":[{"id":"2206.11844","title":"Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features","created":"2022-06-23","cited_by_count":20,"area":null},{"id":"2201.09932","title":"Learning Optimal Fair Classification Trees: Trade-offs Between Interpretability, Fairness, and Accuracy","created":"2022-01-24","cited_by_count":15,"area":null},{"id":"2108.13628","title":"Learning Optimal Prescriptive Trees from Observational Data","created":"2021-08-31","cited_by_count":10,"area":null},{"id":"2401.03451","title":"Optimization Over Trained Neural Networks: Taking a Relaxing Walk","created":"2024-01-07","cited_by_count":10,"area":null},{"id":"2302.06812","title":"Scalable Optimal Multiway-Split Decision Trees with Constraints","created":"2023-02-14","cited_by_count":9,"area":null},{"id":"2409.12788","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","created":"2024-09-19","cited_by_count":9,"area":null},{"id":"2210.10567","title":"Margin Optimal Classification Trees","created":"2022-10-19","cited_by_count":7,"area":null},{"id":"2511.03344","title":"SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration","created":"2025-11-05","cited_by_count":6,"area":null},{"id":"2104.10751","title":"Rule Generation for Classification: Scalability, Interpretability, and Fairness","created":"2021-04-21","cited_by_count":4,"area":null},{"id":"2206.04857","title":"Mixed integer linear optimization formulations for learning optimal binary classification trees","created":"2022-06-10","cited_by_count":4,"area":null},{"id":"2307.15691","title":"ODTlearn: A Package for Learning Optimal Decision Trees for Prediction and Prescription","created":"2023-07-28","cited_by_count":2,"area":null},{"id":"2310.17772","title":"Learning Optimal Classification Trees Robust to Distribution Shifts","created":"2023-10-26","cited_by_count":2,"area":null},{"id":"2211.09894","title":"Supervised Feature Compression based on Counterfactual Analysis","created":"2022-11-17","cited_by_count":1,"area":null},{"id":"2302.14744","title":"Tight Mixed-Integer Optimization Formulations for Prescriptive Trees","created":"2023-02-28","cited_by_count":1,"area":null},{"id":"2304.10830","title":"Rolling Lookahead Learning for Optimal Classification Trees","created":"2023-04-21","cited_by_count":1,"area":null},{"id":"2501.05942","title":"Soft regression trees: a model variant and a decomposition training algorithm","created":"2025-01-10","cited_by_count":1,"area":null},{"id":"2503.12902","title":"Experiments with Optimal Model Trees","created":"2025-03-17","cited_by_count":1,"area":null},{"id":"2605.07598","title":"Optimal Recourse Summaries via Bi-Objective Decision Tree Learning","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2306.00857","title":"Loss-Optimal Classification Trees: A Generalized Framework and the Logistic Case","created":"2023-06-01","cited_by_count":0,"area":null},{"id":"2402.18851","title":"Applications of 0-1 Neural Networks in Prescription and Prediction","created":"2024-02-29","cited_by_count":0,"area":null},{"id":"2407.21090","title":"Learning Optimal Signal Temporal Logic Decision Trees for Classification: A Max-Flow MILP Formulation","created":"2024-07-30","cited_by_count":0,"area":null},{"id":"2510.05047","title":"A Unified Optimization Framework for Multiclass Classification with Structured Hyperplane Arrangements","created":"2025-10-06","cited_by_count":0,"area":null},{"id":"2510.23901","title":"RS-ORT: A Reduced-Space Branch-and-Bound Algorithm for Optimal Regression Trees","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2605.14374","title":"Optimal Pattern Detection Tree for Symbolic Rule-Based Classification","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2609.01430","title":"Learning Sparse Decision Trees via Transformer Variational Auto-Encoders","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2609.05826","title":"Scaling Optimal Classification Trees via Adaptive Feature and Sample Reduction","created":"2026-09-05","cited_by_count":0,"area":null},{"id":"2609.24741","title":"An Exact Junction-Tree Extended Formulation for Optimal Classification Trees","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.38194","title":"A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees","created":"2026-09-18","cited_by_count":0,"area":null}],"next_cursor":null}