Alternatives and similar repositories for SIMCIM-RL

Users that are interested in SIMCIM-RL are comparing it to the libraries listed below

• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆16Updated 6 years ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 5 years ago
• udeshmg / GTA-RL
  Attention based model for learning to solve different routing problems
  ☆40Updated 2 years ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆80Updated 4 years ago
• jokofa / NeuroLS
  Code repository for the corresponding paper "Learning to Control Local Search for Combinatorial Optimization"
  ☆16Updated 8 months 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
• qlan3 / QuantumExplorer
  A quantum reinforcement learning framework based on PyTorch and PennyLane.
  ☆28Updated last year
• 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
• hanxiongwei / L2O-Solver-Papers
  ☆11Updated 5 years ago
• dcaffo98 / transpormer
  TranSPormer: a transformer for the Travelling Salesman Problem
  ☆25Updated last year
• lyeskhalil / mipGNN
  ☆26Updated 4 years ago
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆100Updated 2 years ago
• facebookresearch / CL-LNS
  Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning
  ☆39Updated last year
• Pointerformer / Pointerformer
  Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem
  ☆39Updated 3 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆26Updated 3 years ago
• lyeskhalil / CORL
  ☆25Updated 2 years ago
• paulorocosta / learning-2opt-drl
  Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
  ☆53Updated 4 years ago
• liangxinedu / stepwise
  ☆21Updated 3 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
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆67Updated 3 years ago
• paulorocosta / ai-for-tsp-competition
  This is the official repository of the AI for TSP competition at IJCAI 2021
  ☆24Updated 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
• wz26 / OpenGraphGym
  ☆9Updated 4 years ago
• sajen-k / Quantum_Graph_Recurrent_Neural_Network
  Implementation of Quantum Graph Recurrent Neural Network (QGRNN)
  ☆18Updated 4 years ago
• ahottung / EAS
  Efficient Active Search
  ☆50Updated 3 years ago
• WXY1427 / Learn-LNS-policy
  ☆31Updated 2 years ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆22Updated last year
• Thinklab-SJTU / NAR-CO-Solver
  Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…
  ☆40Updated 8 months ago
• jiang-yuan / Learning-routing-DRO
  ☆21Updated 3 years ago