omargup / neural_combinatorial_optimization
A peper list for machine learning models solving combinatorial problems, NP-hard problems and problems in graphs.
☆14Updated 4 years ago
Alternatives and similar repositories for neural_combinatorial_optimization:
Users that are interested in neural_combinatorial_optimization are comparing it to the libraries listed below
- Attention based model for learning to solve different routing problems☆37Updated 2 years ago
- Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning☆37Updated last year
- ☆16Updated 6 years ago
- Code repository for the corresponding paper "Learning to Control Local Search for Combinatorial Optimization"☆16Updated 4 months ago
- ☆21Updated 3 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆97Updated last year
- ☆23Updated last year
- ☆35Updated 4 years ago
- Efficient Active Search☆48Updated 2 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 5 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆25Updated 3 years ago
- This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…☆55Updated 2 years ago
- [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut☆20Updated 11 months ago
- Population-Based Reinforcement Learning for Combinatorial Optimization☆68Updated last year
- ☆20Updated 5 years ago
- ☆39Updated 3 months ago
- Swarm learning algorithm☆11Updated 3 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- ☆35Updated last year
- ☆31Updated 2 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning☆47Updated 4 years ago
- Code for ICLR2022 Paper: Pareto Set Learning for Neural Multi-objective Combinatorial Optimization☆58Updated 2 years ago
- ☆19Updated 2 years ago
- Implementation of NeurIPS2021 paper <On Effective Scheduling of Model-based Reinforcement Learning>☆12Updated 3 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆30Updated 5 years ago
- ☆51Updated 2 years ago
- Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)☆20Updated 2 years ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆48Updated last year
- Learning in Noisy MDP (which is governed by stochastic, exogenous input processes) with input-dependent baseline☆11Updated 4 years ago