orrivlin / MinimumVertexCover_DRL
Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL
☆76Updated 6 years ago
Alternatives and similar repositories for MinimumVertexCover_DRL
Users that are interested in MinimumVertexCover_DRL are comparing it to the libraries listed below
Sorting:
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 8 months ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 5 years ago
- ☆163Updated 5 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆150Updated 5 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆134Updated 2 years ago
- ☆39Updated last month
- Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization☆191Updated 4 years ago
- ☆35Updated 5 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆98Updated 2 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆33Updated 5 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- ☆47Updated 3 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆33Updated 7 years ago
- ☆37Updated 6 years ago
- Appendix repository for Medium article "Routing Traveling Salesmen on Random Graphs using Reinforcement Learning, in PyTorch"☆57Updated 5 years ago
- [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing☆82Updated 3 years ago
- ☆26Updated 3 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆229Updated 3 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆116Updated 5 years ago
- ☆131Updated 2 years ago
- Efficient Active Search☆49Updated 3 years ago
- Paper collection of reinforcement learning based combinatorial optimization☆52Updated 4 years ago
- Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning☆52Updated 4 years ago
- Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem☆43Updated last year
- Tensorflow implementation of an Actor Critic algorithm using a Pointer Network to solve the TSP (algorithm from Neural Combinatorial Opti…☆43Updated 7 years ago
- ☆28Updated 5 years ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 3 years ago
- ☆107Updated 4 years ago