donfaq / max_clique
Implementation of branch and bound algorithm for maximum clique problem
☆36Updated 7 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:
- Implementation of branch and bound algorithm for maximum clique problem with cplex☆10Updated 7 years ago
- ☆28Updated 5 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 8 months 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
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆76Updated 6 years ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆33Updated 7 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 5 years ago
- Code for the paper 'An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem' (INFORMS Annual Meeting Sessi…☆320Updated 3 years ago
- Shortest Path prediction using Graph Convolutional Networks☆26Updated 7 years ago
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 4 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆376Updated 3 years ago
- Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization☆14Updated 5 years ago
- ☆163Updated 5 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆74Updated last month
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 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)☆229Updated 3 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆45Updated 5 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Finding shortest paths with Graph Networks☆109Updated 6 years ago
- Implementation of "Learning Combinatorial Optimization Algorithms over Graphs"☆503Updated 5 years ago
- PyTorch implementation of NeuroSAT☆28Updated last year
- Learning to Perform Local Rewriting for Combinatorial Optimization☆150Updated 5 years ago
- A benchmarking suite for maximum independent set solvers.☆51Updated last year
- G2SAT: Learning to Generate SAT Formulas☆49Updated 4 years ago
- ☆155Updated last year
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- Graph Neural Network architecture to solve the decision version of the graph coloring problem (GCP)☆26Updated 5 years ago