idea-iitd / GCOMBLinks
☆36Updated 2 years ago
Alternatives and similar repositories for GCOMB
Users that are interested in GCOMB are comparing it to the libraries listed below
Sorting:
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆51Updated 3 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆81Updated 5 years ago
- ☆38Updated 6 years ago
- A curated list of graph reinforcement learning papers.☆76Updated 4 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆34Updated 8 years ago
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆119Updated 6 years ago
- Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling (official code repository)☆29Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆52Updated 2 years ago
- ☆46Updated 2 years ago
- Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"☆23Updated 3 years ago
- A graph neural network tailored to directed acyclic graphs that outperforms conventional GNNs by leveraging the partial order as strong i…☆138Updated last year
- Variational Graph Recurrent Neural Networks - PyTorch☆117Updated 5 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆155Updated last year
- This collection of papers can be used to summarize research about graph reinforcement learning for the convenience of researchers.☆196Updated last year
- Implementation of "ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning" (https://arxiv.org/abs/2…☆30Updated 3 years ago
- Temporal IMLinUCB - a solution for Online Influence Maximization problem in Temporal Networks (based on IMLinUCB)☆17Updated last year
- This repository is the official implementation of Online Influence Maximization under Linear Threshold Model.☆15Updated 5 years ago
- ☆46Updated 9 months ago
- FINDER - FInding key players in complex Networks through DEep Reinforcement learning (Nature Machine Intelligence)☆224Updated 2 years ago
- The source code for NeurIPS 2020 paper "Graph Policy Network for Transferable Active Learning on Graphs"☆47Updated 5 years ago
- ☆164Updated 6 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆104Updated 2 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
- Code for the paper "Group-Fairness in Influence Maximization"☆26Updated 6 years ago
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated 2 years ago
- ☆28Updated 6 years ago
- THAN: Multi-Modal Transportation Recommendation with Heterogeneous Graph Attention Networks☆14Updated last year
- ☆24Updated 5 years ago
- ☆26Updated 3 years ago