Tight mixed-integer optimization formulations for prescriptive trees
From MaRDI portal
Cites work
- A two-stage exact algorithm for optimization of neural network ensemble
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- Auction optimization using regression trees and linear models as integer programs
- Complexity of training ReLU neural network
- Deep neural networks and mixed integer linear optimization
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- JANOS: An Integrated Predictive and Prescriptive Modeling Framework
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Modelling with integer variables
- Optimal classification trees
- Optimization of tree ensembles
- Representability in mixed integer programming. I: Characterization results
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Scikit-learn: machine learning in Python
- Small and strong formulations for unions of convex sets from the Cayley embedding
This page was built for publication: Tight mixed-integer optimization formulations for prescriptive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969272)