donfaq / max_cliqueLinks
Implementation of branch and bound algorithm for maximum clique problem
☆36Updated 8 years ago
Alternatives and similar repositories for max_clique
Users that are interested in max_clique are comparing it to the libraries listed below
Sorting:
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆119Updated 5 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆155Updated last year
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 5 years ago
- Code for the paper 'An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem' (INFORMS Annual Meeting Sessi…☆329Updated 3 years ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- Shortest Path prediction using Graph Convolutional Networks☆27Updated 7 years ago
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆77Updated 6 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 3 years ago
- ☆28Updated 6 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆34Updated 8 years ago
- PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers☆42Updated 2 years ago
- Finding shortest paths with Graph Networks☆114Updated 6 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆154Updated 6 years ago
- Implementation of "Learning Combinatorial Optimization Algorithms over Graphs"☆513Updated 6 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆28Updated 5 years ago
- ☆163Updated 6 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆401Updated 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
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆51Updated 3 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 5 years ago
- ☆42Updated this week
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆103Updated 2 years ago
- Graph Neural Network architecture to solve the decision version of the graph coloring problem (GCP)☆25Updated 5 years ago
- ☆22Updated 4 years ago
- G2SAT: Learning to Generate SAT Formulas☆49Updated 5 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆239Updated 4 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 2 months ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆139Updated 3 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆81Updated 5 years ago