Alternatives and similar repositories for binoct

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

• 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 …
  ☆48Updated 5 months ago
• pan5431333 / pyoptree
  Python Implementation of Bertsimas's "Optimal classification trees".
  ☆33Updated 4 years ago
• D3M-Research-Group / odtlearn
  A package for tree-based statistical estimation and inference using optimal decision trees.
  ☆40Updated last year
• rtm2130 / SPOTree
  ☆33Updated 4 years ago
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆34Updated 4 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆136Updated 2 years ago
• lyeskhalil / mipGNN
  ☆27Updated 4 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆49Updated 4 years ago
• ds4dm / learn2branch
  Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)
  ☆382Updated 3 years ago
• ds4dm / ecole
  Extensible Combinatorial Optimization Learning Environments
  ☆348Updated 3 months ago
• RomeoV / ml4co-competition
  Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.
  ☆13Updated 2 years ago
• awslabs / or-rl-benchmarks
  The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'
  ☆85Updated 4 years ago
• ML-KULeuven / PySDD
  Python package for Sentential Decision Diagrams (SDD)
  ☆63Updated 5 months ago
• xingchenwan / Casmopolitan
  [ICML'21] Think Global and Act Local: Bayesian Optimisation for Categorical and Mixed Search Spaces
  ☆30Updated 2 years ago
• charmlab / mace
  Model Agnostic Counterfactual Explanations
  ☆87Updated 2 years ago
• fidelity / boolxai
  BoolXAI is a research library for machine learning for Explainable AI (XAI) based on expressive Boolean formulas.
  ☆19Updated 9 months ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆72Updated 3 years ago
• vidalt / OCEAN
  OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)
  ☆21Updated last year
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆151Updated 5 years ago
• pylon-lib / pylon
  ☆122Updated last year
• art-ai / pypsdd
  The Python PSDD Package
  ☆17Updated 3 weeks ago
• xkianteb / ApproPO
  Reinforcement Learning with Convex Constraints
  ☆14Updated 3 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated last year
• AishwaryaSivaraman / COMET
  Counterexample-Guided Learning of Monotonic Networks
  ☆18Updated 3 years ago
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆233Updated 3 years ago
• QuMuLab / python-nnf
  Manipulate NNF (Negation Normal Form) logical sentences
  ☆18Updated 2 years ago
• daniellevy / fast-dro
  PyTorch implementation of efficient algorithms for DRO with CVaR and Chi-Square uncertainty sets
  ☆61Updated 2 years ago
• rtm2130 / MST
  Package for building Market Segmentation Trees, Choice Model Trees, and Isotonic Regression Trees
  ☆17Updated 2 years ago
• google-research / tf-opt
  ☆41Updated last week