BeloborodovDS / SIMCIM-RLLinks
Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization
☆15Updated 5 years ago
Alternatives and similar repositories for SIMCIM-RL
Users that are interested in SIMCIM-RL are comparing it to the libraries listed below
Sorting:
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- Code to run the ASEBO algorithm from the paper: From Complexity to Simplicity: Adaptive ES-Active Subspaces for Blackbox Optimization... …☆16Updated 5 years ago
- A quantum reinforcement learning framework based on PyTorch and PennyLane.☆29Updated last year
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆81Updated 5 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆50Updated 3 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆139Updated 3 years ago
- ☆17Updated 7 years ago
- ☆35Updated 5 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆103Updated 2 years ago
- An official JAX-based code for our NeuraLCB paper, "Offline Neural Contextual Bandits: Pessimism, Optimization and Generalization", ICLR…☆13Updated 3 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆34Updated 7 years ago
- ☆162Updated last year
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆119Updated 5 years ago
- ☆27Updated 4 years ago
- [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing☆85Updated 4 years ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆72Updated 3 years ago
- ☆38Updated 6 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆34Updated 6 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 6 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆155Updated last year
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆17Updated 3 years ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆41Updated last year
- ☆41Updated last week
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆51Updated 4 years ago
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆77Updated 6 years ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆67Updated 2 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆239Updated 4 years ago
- ☆34Updated 3 years ago
- Official implementation of NeurIPS'22 paper "Monte Carlo Tree Search based Variable Selection for High-Dimensional Bayesian Optimization"☆42Updated 2 years ago