Alternatives and similar repositories for emllib:

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

• vidalt / OCEAN
  OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)
  ☆20Updated last year
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆30Updated 4 years ago
• D3M-Research-Group / odtlearn
  A package for tree-based statistical estimation and inference using optimal decision trees.
  ☆40Updated 7 months ago
• hwiberg / OptiCL
  An end-to-end framework for mixed-integer optimization with data-driven learned constraints.
  ☆119Updated last year
• JuliaDecisionFocusedLearning / InferOpt.jl
  Combinatorial optimization layers for machine learning pipelines
  ☆117Updated last month
• rkimura47 / cmu-comp-or
  A series of tutorials for conducting computational experiments with optimization solvers
  ☆88Updated 9 months ago
• 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
• alexforel / Explainable-CSO
  Code for "Explainable Data-Driven Optimization" (ICML 2023)
  ☆15Updated last year
• coin-or / Dip
  DIP is a decomposition-based solver framework for mixed integer linear programs.
  ☆19Updated 4 years ago
• ANL-CEEESA / MIPLearn
  Framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (…
  ☆161Updated 2 months ago
• PredOpt / predopt-benchmarks
  ☆34Updated 5 months ago
• pan5431333 / pyoptree
  Python Implementation of Bertsimas's "Optimal classification trees".
  ☆33Updated 4 years ago
• lyeskhalil / mipGNN
  ☆24Updated 3 years ago
• vidalt / Districting-Routing
  Source code associated with the paper "Deep Learning for Data-Driven Districting-and-Routing", authored by A. Ferraz, Q. Cappart, and T. …
  ☆24Updated 6 months ago
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆102Updated 2 years ago
• SiccoVerwer / binoct
  Binary Programming Formulation for Learning Classification Trees Using Cplex
  ☆12Updated 6 years ago
• rtm2130 / SPOTree
  ☆33Updated 4 years ago
• ghackebeil / pybnb
  A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)
  ☆68Updated 3 years ago
• google-research / tf-opt
  ☆39Updated 3 months ago
• aia-uclouvain / pydl8.5
  An algorithm for learning optimal decision trees, with Python interface
  ☆63Updated last year
• Gurobi / gurobi-machinelearning
  Formulate trained predictors in Gurobi models
  ☆222Updated 2 weeks ago
• cog-imperial / romodel
  Modeling robust optimization problems in Pyomo
  ☆83Updated 2 years ago
• kanguyn / Machine-Learning-Under-Optimization-Lens-Fall2018
  Work from class 15.095 Machine Learning Under a Modern Optimization Lens at MIT taught by Dimitris Bertsimas and Martin Copenhaver
  ☆36Updated 5 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆49Updated 3 years ago
• xiyanghu / OSDT
  Optimal Sparse Decision Trees
  ☆102Updated last year
• awslabs / or-rl-benchmarks
  The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'
  ☆84Updated 3 years ago
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆13Updated 3 years ago
• joehuchette / ISCO-spring-school
  Material for the ISCO 2018 spring school: “Advanced Mixed Integer Programming Formulation Techniques”
  ☆15Updated 6 years ago
• ambros-gleixner / MIPcc23
  The MIP Workshop 2023 Computational Competition
  ☆41Updated last year
• ortec / euro-neurips-vrp-2022-quickstart
  Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition
  ☆90Updated last year