RomeoV / ml4co-competitionLinks
Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.
☆13Updated 2 years ago
Alternatives and similar repositories for ml4co-competition
Users that are interested in ml4co-competition are comparing it to the libraries listed below
Sorting:
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆137Updated 3 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆151Updated 5 years ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆66Updated 2 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆235Updated 4 years ago
- ☆43Updated 4 months ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆50Updated 3 years ago
- ☆37Updated 6 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆101Updated 2 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 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
- ☆23Updated last year
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 4 years ago
- ☆163Updated 5 years ago
- This is the official repository of the AI for TSP competition at IJCAI 2021☆25Updated 2 years ago
- ☆35Updated 5 years ago
- [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing☆85Updated 3 years ago
- ☆34Updated 3 years ago
- Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"☆22Updated 3 years ago
- ☆27Updated 4 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆34Updated 6 years ago
- Code for TSP Transformer☆190Updated 4 years ago
- ☆79Updated 3 years ago
- ☆131Updated 2 years ago
- Reinforcement Learning for Cut Selection☆11Updated 2 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆36Updated 6 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆43Updated last year
- ☆11Updated 5 years ago
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆34Updated 4 years ago
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆117Updated 5 years ago