Journal article · 2026 · Open access

Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees

Brandon Alston, Hamidreza Validi, Illya V. Hicks

INFORMS journal on computing · Published 12 March 2026 · DOI 10.1287/ijoc.2023.0068

Open PDFView at the publisherCite this paper

In brief

“Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees” is a 2026 journal article by Brandon Alston and 2 co-authors, published in INFORMS journal on computing. OpenAlex counts 7 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
7
Most cited in
2026 (4)
Field-weighted impact
5.55
References
62
Authors
3

Abstract

Decision trees are powerful supervised machine learning tools for classification and regression that attract many academic researchers and industry professionals. In particular, decision trees provide interpretability, which is often preferred over other higher-accuracy methods that are relatively uninterpretable. An optimal binary classification tree has two types of vertices and is obtainable by solving a bi-objective optimization problem that seeks to (i) maximize the number of correctly classified datapoints and (ii) minimize the number of branching vertices. In this paper, we propose two mixed integer linear optimization (MILO) formulations for designing optimal binary classification trees: a maximum flow-based formulation and a minimum cut-based formulation, both of which share a common base model. The formulations enforce connected feasible paths for training datapoints through flow-based or cut-based connectivity constraints while maintaining computational tractability without the need for decomposition techniques commonly used to combat scaling concerns. We show theoretical improvements on the strongest flow-based MILO formulation currently in the literature and conduct experiments on publicly available data sets to demonstrate our models’ ability to scale, strength against traditional branch-and-bound approaches, and robustness in out-of-sample test performance. Our code and data are available on GitHub. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This research was supported by the Office of Naval Research [Grant N000142412648]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0068 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0068 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Alston, B., Validi, H., & Hicks, I. V. (2026). Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees. INFORMS journal on computing. https://doi.org/10.1287/ijoc.2023.0068

MLA 9

Alston, Brandon, et al. “Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees.” INFORMS journal on computing, 2026. https://doi.org/10.1287/ijoc.2023.0068.

Chicago

Alston, Brandon, Hamidreza Validi, and Illya V. Hicks. 2026. “Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees.” INFORMS journal on computing. https://doi.org/10.1287/ijoc.2023.0068.

Harvard

Alston, B., Validi, H. and Hicks, I. V. (2026) ‘Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees’, INFORMS journal on computing. doi:10.1287/ijoc.2023.0068.

IEEE

B. Alston, H. Validi, and I. V. Hicks, “Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees,” INFORMS journal on computing, 2026, doi: 10.1287/ijoc.2023.0068.

BibTeX

@article{alston2026mixed,
  title     = {{Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees}},
  author    = {Alston, Brandon and Validi, Hamidreza and Hicks, Illya V.},
  journal   = {INFORMS journal on computing},
  year      = {2026},
  doi       = {10.1287/ijoc.2023.0068},
  url       = {https://doi.org/10.1287/ijoc.2023.0068}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202422
202511
202644

Its field-weighted citation impact is 5.55: it has been cited 5.55 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 › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • binary classification tree
  • decision tree
  • mixed-integer linear programming
  • bi-objective optimization
  • interpretability
  • connectivity constraints
  • out-of-sample performance

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Alston, B., Validi, H., & Hicks, I. V. (2026). Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees. INFORMS journal on computing. https://doi.org/10.1287/ijoc.2023.0068

How many times has this paper been cited?

7 times, according to OpenAlex on 18 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?

Brandon Alston, Hamidreza Validi, Illya V. Hicks.

What is the DOI of this paper?

10.1287/ijoc.2023.0068, permanently at https://doi.org/10.1287/ijoc.2023.0068. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 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.