New optimization models for optimal classification trees
Year of publication: |
2024
|
---|---|
Authors: | Ales, Zacharie ; Huré, Valentine ; Lambert, Amélie |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 164.2024, Art.-No. 106515, p. 1-18
|
Subject: | Combinatorial optimization | Linearizations | Mixed binary programming | Optimal classification trees | Quadratic programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Klassifikation | Classification |
-
Sparsity in optimal randomized classification trees
Blanquero, Rafael, (2020)
-
Margin optimal classification trees
D'Onofrio, Federico, (2024)
-
The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications
Punnen, Abraham P., (2022)
- More ...
-
An efficient compact quadratic convex reformulation for general integer quadratic programs
Billionnet, Alain, (2013)
-
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain, (2017)
-
A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem
Lambert, Amélie, (2024)
- More ...