Alternatives and similar repositories for ml4co-competition:

Users that are interested in ml4co-competition are comparing it to the libraries listed below

• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆131Updated 2 years ago
• DIMESTeam / DIMES
  ☆41Updated last month
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 3 years ago
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆31Updated 4 years ago
• lyeskhalil / mipGNN
  ☆25Updated 3 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆25Updated 3 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
• WXY1427 / Learn-LNS-policy
  ☆31Updated 2 years ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated 10 months ago
• google-deepmind / neural_lns
  ☆44Updated 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
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆49Updated 2 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).
  ☆32Updated 5 years ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆21Updated last year
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆99Updated last year
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆21Updated 2 years ago
• lascavana / rl2branch
  ☆17Updated 5 months ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆36Updated 7 months ago
• paulorocosta / ai-for-tsp-competition
  This is the official repository of the AI for TSP competition at IJCAI 2021
  ☆23Updated 2 years ago
• yunzhuangshen / PB-DFS
  ☆11Updated 3 years ago
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 4 years ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆81Updated 4 years ago
• google-research / tf-opt
  ☆39Updated last week
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 5 years ago
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆150Updated 5 years ago
• alstn12088 / LCP
  ☆21Updated 2 years ago
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆62Updated last year
• wz26 / OpenGraphGym
  ☆9Updated 3 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆16Updated 6 years ago