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
  ☆137Updated 3 years ago
• DIMESTeam / DIMES
  ☆44Updated 5 months ago
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆151Updated 5 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 4 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
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆235Updated 4 years ago
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆66Updated 2 years ago
• mit-wu-lab / learning-to-delegate
  [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing
  ☆85Updated 3 years ago
• louisv123 / COLGE
  ☆37Updated 6 years ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆80Updated 4 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
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 4 years ago
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆101Updated 2 years ago
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• xbresson / TSP_Transformer
  Code for TSP Transformer
  ☆190Updated 4 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
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• qiang-ma / graph-pointer-network
  ☆164Updated 5 years ago
• alstn12088 / LCP
  ☆21Updated 2 years ago
• liangxinedu / NeuroLKH
  ☆79Updated 3 years ago
• Spider-scnu / TSP
  ☆132Updated 2 years ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆44Updated last year
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆36Updated 6 years ago
• lyeskhalil / mipGNN
  ☆27Updated 4 years ago
• xyfffff / rethink_mcts_for_tsp
  [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
  ☆39Updated 6 months ago
• qcappart / hybrid-cp-rl-solver
  Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
  ☆198Updated 5 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…
  ☆117Updated 5 years ago
• wouterkool / dpdp
  DPDP
  ☆101Updated 2 years ago
• lyeskhalil / CORL
  ☆25Updated 3 years ago
• paulorocosta / ai-for-tsp-competition
  This is the official repository of the AI for TSP competition at IJCAI 2021
  ☆25Updated 2 years ago