Paper · 2019

Learning Optimal Classification Trees Using a Binary Linear Program Formulation.

Sicco Verwer, Yingqian Zhang

TU/e Research Portal · Published 1 January 2019

View at the publisherCite this paper

In brief

“Learning Optimal Classification Trees Using a Binary Linear Program Formulation.” is a 2019 paper by Sicco Verwer and Yingqian Zhang, published in TU/e Research Portal. OpenAlex counts 1 citations as of 20 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
1
Most cited in
2025 (1)
Authors
2

Abstract

We provide a new formulation for the problem of learning the optimal classification tree of a given depth as a binary linear program. A limitation of previously proposed mathematical Optimization formulations is that they create constraints and variables for every row in the training data. As a result, the running time of the existing Integer… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Verwer, S., & Zhang, Y. (2019). Learning Optimal Classification Trees Using a Binary Linear Program Formulation. TU/e Research Portal. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=906016

MLA 9

Verwer, Sicco, and Yingqian Zhang. “Learning Optimal Classification Trees Using a Binary Linear Program Formulation.” TU/e Research Portal, 2019. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=906016.

Chicago

Verwer, Sicco and Yingqian Zhang. 2019. “Learning Optimal Classification Trees Using a Binary Linear Program Formulation.” TU/e Research Portal. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=906016.

Harvard

Verwer, S. and Zhang, Y. (2019) ‘Learning Optimal Classification Trees Using a Binary Linear Program Formulation.’, TU/e Research Portal. Available at: http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=906016.

IEEE

S. Verwer and Y. Zhang, “Learning Optimal Classification Trees Using a Binary Linear Program Formulation.,” TU/e Research Portal, 2019.

BibTeX

@article{verwer2019learning,
  title     = {{Learning Optimal Classification Trees Using a Binary Linear Program Formulation.}},
  author    = {Verwer, Sicco and Zhang, Yingqian},
  journal   = {TU/e Research Portal},
  year      = {2019},
  url       = {http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=906016}
}

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

Topic and keywords

Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications

  • classification trees
  • binary linear programming
  • integer linear programming
  • tree induction
  • computational efficiency
  • training data size

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Verwer, S., & Zhang, Y. (2019). Learning Optimal Classification Trees Using a Binary Linear Program Formulation. TU/e Research Portal. http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=906016

How many times has this paper been cited?

1 times, according to OpenAlex on 20 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Sicco Verwer, Yingqian Zhang.

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