Paper · 2018

A Branch-and-Price approach to find optimal decision trees

Murat Fırat, Guillaume Crognier, Adriana Felicia Gabor, Yingqian Zhang

TU/e Research Portal · Published 8 July 2018

View at the publisherCite this paper

In brief

“A Branch-and-Price approach to find optimal decision trees” is a 2018 paper by Murat Fırat and 3 co-authors, published in TU/e Research Portal. OpenAlex counts 0 citations as of 21 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
4

Abstract

In Artificial Intelligence (AI) field, decision trees have gained certain importance due to their effectiveness in solving classification and regression problems. Recently, in the literature we see finding optimal decision trees are formulated as Mixed Integer Linear Programming (MILP) models. This elegant way enables us to construct optimal decision trees with different error concerns. In… 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

Fırat, M., Crognier, G., Gabor, A. F., & Zhang, Y. (2018). A Branch-and-Price approach to find optimal decision trees. TU/e Research Portal. https://research.tue.nl/en/publications/1ed2c324-51d3-4658-a2b4-a4f4afc31a79

MLA 9

Fırat, Murat, et al. “A Branch-and-Price approach to find optimal decision trees.” TU/e Research Portal, 2018. https://research.tue.nl/en/publications/1ed2c324-51d3-4658-a2b4-a4f4afc31a79.

Chicago

Fırat, Murat, Guillaume Crognier, Adriana Felicia Gabor, and Yingqian Zhang. 2018. “A Branch-and-Price approach to find optimal decision trees.” TU/e Research Portal. https://research.tue.nl/en/publications/1ed2c324-51d3-4658-a2b4-a4f4afc31a79.

Harvard

Fırat, M. et al. (2018) ‘A Branch-and-Price approach to find optimal decision trees’, TU/e Research Portal. Available at: https://research.tue.nl/en/publications/1ed2c324-51d3-4658-a2b4-a4f4afc31a79.

IEEE

M. Fırat, G. Crognier, A. F. Gabor, and Y. Zhang, “A Branch-and-Price approach to find optimal decision trees,” TU/e Research Portal, 2018.

BibTeX

@article{frat2018branch,
  title     = {{A Branch-and-Price approach to find optimal decision trees}},
  author    = {Fırat, Murat and Crognier, Guillaume and Gabor, Adriana Felicia and Zhang, Yingqian},
  journal   = {TU/e Research Portal},
  year      = {2018},
  url       = {https://research.tue.nl/en/publications/1ed2c324-51d3-4658-a2b4-a4f4afc31a79}
}

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

  • optimal decision trees
  • branch-and-price
  • column generation
  • mixed-integer linear programming
  • classification
  • regression analysis
  • combinatorial optimization

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?

Fırat, M., Crognier, G., Gabor, A. F., & Zhang, Y. (2018). A Branch-and-Price approach to find optimal decision trees. TU/e Research Portal. https://research.tue.nl/en/publications/1ed2c324-51d3-4658-a2b4-a4f4afc31a79

How many times has this paper been cited?

0 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?

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?

Murat Fırat, Guillaume Crognier, Adriana Felicia Gabor, Yingqian Zhang.

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.