Journal article · 2024 · Open access
Strong Optimal Classification Trees
Operations Research, 73(4), 2223–2241 · Published 31 July 2024 · DOI 10.1287/opre.2021.0034
In brief
“Strong Optimal Classification Trees” is a 2024 journal article by Sina Aghaei and 2 co-authors, published in Operations Research. OpenAlex counts 118 citations as of 21 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 118
- Most cited in
- 2026 (52)
- Field-weighted impact
- 17.52
- References
- 84
- Authors
- 3
Abstract
Decision trees are among the most interpretable and popular machine learning models that are used routinely in applications ranging from revenue management to medicine. Traditional heuristic methods, although fast, lack modeling flexibility for incorporating constraints such as fairness and do not guarantee optimality. Recent efforts aim to overcome these limitations using mixed-integer optimization (MIO) for better modeling flexibility and optimality, but speed remains an issue. In “Strong Optimal Classification Trees,” Aghaei, Gómez, and Vayanos use integer optimization and polyhedral theory to create an MIO-based formulation with a strong LO relaxation resulting in a 29% speed-up in training time compared with state-of-the-art MIO-based formulations, as well as up to an 8% improvement in out-of-sample accuracy.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Aghaei, S., Gómez, A., & Vayanos, P. (2024). Strong Optimal Classification Trees. Operations Research, 73(4), 2223–2241. https://doi.org/10.1287/opre.2021.0034
MLA 9
Aghaei, Sina, et al. “Strong Optimal Classification Trees.” Operations Research, vol. 73, no. 4, 2024, pp. 2223–2241. https://doi.org/10.1287/opre.2021.0034.
Chicago
Aghaei, Sina, Andrés Gómez, and Phebe Vayanos. 2024. “Strong Optimal Classification Trees.” Operations Research 73 (4): 2223–2241. https://doi.org/10.1287/opre.2021.0034.
Harvard
Aghaei, S., Gómez, A. and Vayanos, P. (2024) ‘Strong Optimal Classification Trees’, Operations Research, 73(4), pp. 2223–2241. doi:10.1287/opre.2021.0034.
IEEE
S. Aghaei, A. Gómez, and P. Vayanos, “Strong Optimal Classification Trees,” Operations Research, vol. 73, no. 4, pp. 2223–2241, 2024, doi: 10.1287/opre.2021.0034.
BibTeX
@article{aghaei2024strong,
title = {{Strong Optimal Classification Trees}},
author = {Aghaei, Sina and Gómez, Andrés and Vayanos, Phebe},
journal = {Operations Research},
year = {2024},
volume = {73},
number = {4},
pages = {2223--2241},
doi = {10.1287/opre.2021.0034},
url = {https://doi.org/10.1287/opre.2021.0034}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 1 | |
| 2022 | 7 | |
| 2023 | 15 | |
| 2024 | 25 | |
| 2025 | 18 | |
| 2026 | 52 |
Its field-weighted citation impact is 17.52: it has been cited 17.52 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- classification trees
- mixed integer programming
- linear programming relaxation
- polyhedral theory
- decision tree
- out-of-sample accuracy
- fairness constraints
- model interpretability
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Aghaei, S., Gómez, A., & Vayanos, P. (2024). Strong Optimal Classification Trees. Operations Research, 73(4), 2223–2241. https://doi.org/10.1287/opre.2021.0034
How many times has this paper been cited?
118 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Sina Aghaei, Andrés Gómez, Phebe Vayanos.
What is the DOI of this paper?
10.1287/opre.2021.0034, permanently at https://doi.org/10.1287/opre.2021.0034. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.