xuzijian629 / combopt-zeroLinks
A reinforcement learning based solver for combinatorial problems
☆44Updated 3 years ago
Alternatives and similar repositories for combopt-zero
Users that are interested in combopt-zero are comparing it to the libraries listed below
Sorting:
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆137Updated 3 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated last year
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Code to run the ASEBO algorithm from the paper: From Complexity to Simplicity: Adaptive ES-Active Subspaces for Blackbox Optimization... …☆16Updated 4 years ago
- Solving Traveling Salesman Problem with reinforcement learning...☆57Updated 6 years ago
- A framework for easy prototyping of distributed reinforcement learning algorithms☆96Updated 4 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆77Updated 6 years ago
- A peper list for machine learning models solving combinatorial problems, NP-hard problems and problems in graphs.☆13Updated 5 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆27Updated 4 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆151Updated 5 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆233Updated 4 years ago
- Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning☆43Updated 2 years ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆72Updated 3 years ago
- Population-Based Reinforcement Learning for Combinatorial Optimization☆80Updated last year
- ☆35Updated 5 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆34Updated 5 years ago
- Graph Neural Network architecture to solve the decision version of the graph coloring problem (GCP)☆25Updated 5 years ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆49Updated 4 years ago
- The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'☆84Updated 4 years ago
- ☆37Updated 6 years ago
- Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problem and its Variants☆27Updated last year
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆380Updated 3 years ago
- ☆17Updated 6 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- A novel parallel UCT algorithm with linear speedup and negligible performance loss.☆120Updated 4 years ago
- Code for TSP Transformer☆190Updated 4 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆100Updated 2 years ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- ☆16Updated 3 years ago