Alternatives and similar repositories for neural_combinatorial_optimization

Users that are interested in neural_combinatorial_optimization are comparing it to the libraries listed below

• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆17Updated 7 years ago
• facebookresearch / CL-LNS
  Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning
  ☆45Updated 2 years ago
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆103Updated 2 years ago
• liangxinedu / stepwise
  ☆21Updated 4 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 4 years ago
• Alekat13 / Deep-Reinforcement-Ant-Colony-Optimization-
  Swarm learning algorithm
  ☆11Updated 4 years ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆21Updated last year
• google-research / tf-opt
  ☆41Updated last week
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• instadeepai / poppy
  Population-Based Reinforcement Learning for Combinatorial Optimization
  ☆83Updated last year
• atavakol / action-hypergraph-networks
  (ICLR 2021) Learning to Represent Action Values as a Hypergraph on the Action Vertices
  ☆23Updated 4 years ago
• udeshmg / GTA-RL
  Attention based model for learning to solve different routing problems
  ☆43Updated 3 years ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 6 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
• ita9naiwa / TSP-solver-using-reinforcement-learning
  Solving Traveling Salesman Problem with reinforcement learning...
  ☆57Updated 6 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆139Updated 3 years ago
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆153Updated 5 years ago
• yining043 / PDP-N2S
  This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…
  ☆61Updated 3 years ago
• paulorocosta / ai-for-tsp-competition
  This is the official repository of the AI for TSP competition at IJCAI 2021
  ☆27Updated 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).
  ☆34Updated 6 years ago
• jokofa / NeuroLS
  Code repository for the corresponding paper "Learning to Control Local Search for Combinatorial Optimization"
  ☆16Updated last year
• xuzijian629 / combopt-zero
  A reinforcement learning based solver for combinatorial problems
  ☆44Updated 3 years ago
• orrivlin / MinimumVertexCover_DRL
  Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL
  ☆77Updated 6 years ago
• lyeskhalil / CORL
  ☆25Updated 3 years ago
• qiang-ma / graph-pointer-network
  ☆163Updated 6 years ago
• awslabs / or-rl-benchmarks
  The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'
  ☆85Updated 4 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆51Updated 4 years ago
• jingwenli0312 / Heterogeneous-Attentions-PDP-DRL
  ☆60Updated 3 years ago
• dcaffo98 / transpormer
  TranSPormer: a transformer for the Travelling Salesman Problem
  ☆26Updated last year