SiccoVerwer / binoct
Binary Programming Formulation for Learning Classification Trees Using Cplex
☆12Updated 6 years ago
Alternatives and similar repositories for binoct:
Users that are interested in binoct are comparing it to the libraries listed below
- A package for tree-based statistical estimation and inference using optimal decision trees.☆40Updated 9 months ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 3 years ago
- Python Implementation of Bertsimas's "Optimal classification trees".☆33Updated 4 years ago
- This repository is the the implementation of the JAIR paper: https://doi.org/10.1613/jair.1.15320. This repository provides the codebase …☆40Updated 2 months ago
- ☆33Updated 4 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆134Updated 2 years ago
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆30Updated 4 years ago
- ☆26Updated 3 years ago
- ☆11Updated 3 years ago
- OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)☆20Updated last year
- Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"☆38Updated 10 months ago
- The Machine Learning Optimizer☆104Updated 2 years ago
- Representing CP problems as graphs☆18Updated 4 months ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆73Updated 3 years ago
- Experiments with distributionally robust optimization (DRO) for deep neural networks☆39Updated 5 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- Adaptive Cut Selection in Mixed-Integer Linear Programming☆13Updated last year
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆229Updated 3 years ago
- Optimal Sparse Decision Trees☆104Updated 2 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago
- Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.☆20Updated 11 months ago
- Work from class 15.095 Machine Learning Under a Modern Optimization Lens at MIT taught by Dimitris Bertsimas and Martin Copenhaver☆40Updated 6 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆37Updated 8 months ago
- A series of tutorials for conducting computational experiments with optimization solvers☆89Updated last year
- Reinforcement Learning for Cut Selection☆11Updated 2 years ago
- ☆46Updated 3 years ago
- An end-to-end framework for mixed-integer optimization with data-driven learned constraints.☆122Updated last year
- Code for the paper "Smart 'Predict, then Optimize'"☆75Updated 9 months ago
- ☆13Updated 4 years ago
- Extensible Combinatorial Optimization Learning Environments☆339Updated 2 weeks ago