idea-iitd / GCOMB
☆35Updated 2 years ago
Alternatives and similar repositories for GCOMB:
Users that are interested in GCOMB are comparing it to the libraries listed below
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆49Updated 3 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆33Updated 7 years ago
- Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling (official code repository)☆29Updated 2 years ago
- ☆37Updated 6 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- A curated list of graph reinforcement learning papers.☆70Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆51Updated last year
- ☆41Updated 2 years ago
- DISCO: Influence Maximization Meets Graph Embedding and Deep Learning (a.k.a. PIANO)☆14Updated 3 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 8 months ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆98Updated 2 years ago
- ☆42Updated this week
- Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"☆22Updated 3 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆15Updated 2 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆26Updated 3 years ago
- Temporal IMLinUCB - a solution for Online Influence Maximization problem in Temporal Networks (based on IMLinUCB)☆16Updated last year
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆64Updated last year
- ☆28Updated 5 years ago
- Scalable and computationally efficient deep reinforcement learning framework for influence maximization☆12Updated 2 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆31Updated 7 months ago
- ☆23Updated 4 years ago
- ☆23Updated last year
- Implementation of "ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning" (https://arxiv.org/abs/2…☆27Updated 2 years ago
- ☆24Updated 2 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆37Updated 8 months ago
- This repository is the official implementation of Online Influence Maximization under Linear Threshold Model.☆15Updated 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
- 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
- Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".☆14Updated 2 years ago
- Code for "Towards Scale-Invariant Graph-related Problem Solving by Iterative Homogeneous GNNs" (NeurIPS 2020)☆18Updated 4 years ago