Alternatives and similar repositories for learning-DD

Users that are interested in learning-DD are comparing it to the libraries listed below

• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 4 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆139Updated 3 years ago
• ds4dm / learn2branch
  Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)
  ☆394Updated 3 years ago
• isl-org / NPHard
  Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
  ☆155Updated last year
• lyeskhalil / mipGNN
  ☆27Updated 4 years ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆81Updated 5 years ago
• chaitjo / learning-paradigms-for-tsp
  Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)
  ☆33Updated 4 years ago
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆152Updated 5 years ago
• yunzhuangshen / PB-DFS
  ☆12Updated 4 years ago
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 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
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆72Updated 3 years ago
• google-deepmind / neural_lns
  ☆49Updated 3 years ago
• alexnowakvila / QAP_pt
  ☆28Updated 5 years ago
• Spider-scnu / Monte-Carlo-tree-search-for-TSP
  This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).
  ☆34Updated 6 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 4 years ago
• ds4dm / ecole
  Extensible Combinatorial Optimization Learning Environments
  ☆359Updated 6 months ago
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆68Updated 4 years ago
• Opt-Mucca / Adaptive-Cutsel-MILP
  Adaptive Cut Selection in Mixed-Integer Linear Programming
  ☆15Updated 2 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆50Updated 3 years ago
• machine-reasoning-ufrgs / TSP-GNN
  Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…
  ☆118Updated 5 years ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• jparkerholder / ASEBO
  Code to run the ASEBO algorithm from the paper: From Complexity to Simplicity: Adaptive ES-Active Subspaces for Blackbox Optimization... …
  ☆16Updated 5 years ago
• qcappart / hybrid-cp-rl-solver
  Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
  ☆201Updated 5 years ago
• corail-research / learning-generic-csp
  Representing CP problems as graphs
  ☆19Updated 11 months ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated last year
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆45Updated last year
• qiang-ma / graph-pointer-network
  ☆164Updated 5 years ago
• liujl11git / GNN-MILP
  [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…
  ☆53Updated 2 years ago