isl-org / NPHardLinks
Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
☆154Updated 9 months ago
Alternatives and similar repositories for NPHard
Users that are interested in NPHard are comparing it to the libraries listed below
Sorting:
- ☆28Updated 5 years ago
- Implementation of "Learning Combinatorial Optimization Algorithms over Graphs"☆505Updated 6 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆379Updated 3 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆151Updated 5 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆33Updated 7 years ago
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆77Updated 6 years ago
- Code for the paper 'An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem' (INFORMS Annual Meeting Sessi…☆322Updated 3 years ago
- pytorch implementation of structure2vec (https://arxiv.org/abs/1603.05629)☆310Updated 6 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆134Updated 2 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆231Updated 3 years ago
- ☆163Updated 5 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆49Updated 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
- ☆37Updated 6 years ago
- The repository archives papers regarding the combination of combinatorial optimization and machine learning and corresponding reading not…☆163Updated 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
- ☆35Updated 2 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆100Updated 2 years ago
- PyTorch implementation of Neural Combinatorial Optimization with Reinforcement Learning https://arxiv.org/abs/1611.09940☆582Updated 7 years ago
- Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"☆39Updated 6 years ago
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆33Updated 4 years ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆73Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆51Updated last year
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 4 years ago
- Extensible Combinatorial Optimization Learning Environments☆343Updated 2 months ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆27Updated 5 years ago
- ☆11Updated 5 years ago
- Training computational graph on top of structured data (string, graph, etc)☆288Updated 4 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago