Dissertation · 2024 · Open access
Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas
LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Published 29 May 2024
In brief
“Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas” is a 2024 dissertation by Victor José de Sousa Koehler, published in LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). OpenAlex counts 0 citations as of 21 November 2026. It is open access under a CC BY-ND licence: the full text is free to read at LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas).
- Citations
- 0
- References
- 22
- Authors
- 1
Abstract
Classification trees are very useful techniques in the field of machine learning due to the ease of human interpretation of their predictions. Motivated by the improvement of algorithms and hardware capacity for solving integer programming problems, recent works address the creation of optimal classification trees through linear models, the most general model being entitled Optimal Classification Trees (OCT). We propose in this work a reformulation of the OCT, valid inequalities based on the precedence graph of the learning input and a branch-and-cut strategy on the restrictions that depend on the number n of points that is very large in several instances of the literature. In addition, we present techniques and strategies to mitigate the high computational cost linked to this high dimensionality of points through their reduction, by means of heuristics and exact models, aiming to establish a trade-off between assertiveness, representativeness and models execution time. The results demonstrate that the model reformulation reduces on average 57% the computational time of the OCT, and that the precedence inequalities decrease in 58% the number of nodes solved by the branch-and-bound strategies.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Koehler, V. J. D. S. (2024). Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). https://repositorio.ufpb.br/jspui/handle/123456789/34179
MLA 9
Koehler, Victor José de Sousa. “Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas.” LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas), 2024. https://repositorio.ufpb.br/jspui/handle/123456789/34179.
Chicago
Koehler, Victor José de Sousa. 2024. “Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas.” LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). https://repositorio.ufpb.br/jspui/handle/123456789/34179.
Harvard
Koehler, V. J. D. S. (2024) ‘Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas’, LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). Available at: https://repositorio.ufpb.br/jspui/handle/123456789/34179.
IEEE
V. J. D. S. Koehler, “Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas,” LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas), 2024.
BibTeX
@phdthesis{koehler2024novos,
title = {{Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas}},
author = {Koehler, Victor José de Sousa},
year = {2024},
url = {https://repositorio.ufpb.br/jspui/handle/123456789/34179}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- mixed-integer linear programming
- model reformulation
- valid inequalities
- precedence graph
- branch-and-cut
- computational complexity reduction
- heuristics
- high-dimensional data
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Koehler, V. J. D. S. (2024). Novos métodos de programação linear inteira mista para o problema das árvores de classificação ótimas. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). https://repositorio.ufpb.br/jspui/handle/123456789/34179
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?
Yes. It is open access at LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas): sign in and open the PDF from this page.
Who wrote this paper?
Victor José de Sousa Koehler.
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.