Alternatives and similar repositories for odtlearn:

Users that are interested in odtlearn are comparing it to the libraries listed below

• vidalt / OCEAN
  OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)
  ☆20Updated last year
• rtm2130 / SPOTree
  ☆33Updated 4 years ago
• alexforel / Explainable-CSO
  Code for "Explainable Data-Driven Optimization" (ICML 2023)
  ☆14Updated last year
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆31Updated 4 years ago
• PredOpt / predopt-benchmarks
  This repository is the the implementation of the JAIR paper: https://doi.org/10.1613/jair.1.15320. This repository provides the codebase …
  ☆37Updated last month
• vidalt / BA-Trees
  Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the …
  ☆65Updated last year
• JuliaDecisionFocusedLearning / InferOpt.jl
  Combinatorial optimization layers for machine learning pipelines
  ☆120Updated this week
• hwiberg / OptiCL
  An end-to-end framework for mixed-integer optimization with data-driven learned constraints.
  ☆122Updated last year
• ambros-gleixner / MIPcc23
  The MIP Workshop 2023 Computational Competition
  ☆41Updated last year
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆26Updated last year
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 3 years ago
• pan5431333 / pyoptree
  Python Implementation of Bertsimas's "Optimal classification trees".
  ☆33Updated 4 years ago
• airbus / discrete-optimization
  Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.
  ☆56Updated last week
• Opt-Mucca / PySCIPOpt-ML
  Python interface to automatically formulate Machine Learning models into Mixed-Integer Programs
  ☆26Updated last month
• nsidn98 / NICE
  Combining Reinforcement Learning with Integer Programming for Robust Scheduling
  ☆26Updated last year
• stellatogrp / mro_experiments
  ☆26Updated last month
• Gurobi / pres-mipheur
  Presentation: Custom MIP Heuristics
  ☆34Updated 3 years ago
• rkimura47 / cmu-comp-or
  A series of tutorials for conducting computational experiments with optimization solvers
  ☆89Updated 11 months ago
• lyeskhalil / mipGNN
  ☆26Updated 3 years ago
• rtm2130 / MST
  Package for building Market Segmentation Trees, Choice Model Trees, and Isotonic Regression Trees
  ☆16Updated 2 years ago
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆21Updated last month
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆104Updated 2 years ago
• CausalML / StochOptForest
  Replication Code for Paper "Stochastic Optimization Forests".
  ☆19Updated 3 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated 9 months ago
• alisaab / l0bnb
  Solves the best subset selection problem
  ☆46Updated 3 years ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆72Updated 2 years ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆21Updated 2 years ago
• corail-research / SeaPearl.jl
  Julia hybrid constraint programming solver enhanced by a reinforcement learning driven search.
  ☆169Updated last year
• scipopt / PyGCGOpt
  Python interface and modeling environment for GCG
  ☆19Updated 2 months ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 3 years ago