Alternatives and similar repositories for ml4co-competition

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

• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆30Updated 4 years ago
• DIMESTeam / DIMES
  ☆42Updated last week
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆134Updated 2 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆26Updated 3 years ago
• ha0ransun / Path-Auxiliary-Sampler
  ☆11Updated 2 years ago
• facebookresearch / CL-LNS
  Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning
  ☆39Updated last year
• WXY1427 / Learn-LNS-policy
  ☆31Updated 2 years ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆73Updated 3 years ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆21Updated last year
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆64Updated last year
• 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
• lyeskhalil / mipGNN
  ☆26Updated 3 years ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 3 years ago
• martius-lab / blackbox-differentiation-combinatorial-solvers
  ☆22Updated 3 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).
  ☆33Updated 5 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆49Updated 3 years ago
• google-deepmind / neural_lns
  ☆46Updated 3 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆16Updated 6 years ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆21Updated 2 years ago
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆37Updated 8 months ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆98Updated 2 years ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆80Updated 4 years ago
• google-research / tf-opt
  ☆39Updated last month
• Graph-COM / Meta_CO
  the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning
  ☆9Updated 2 years ago
• lascavana / rl2branch
  ☆18Updated 7 months ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 5 years ago