donfaq / max_cliqueLinks
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:
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 9 months ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 4 years ago
- ☆28Updated 5 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
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆76Updated 6 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆33Updated 7 years ago
- Implementation of branch and bound algorithm for maximum clique problem with cplex☆10Updated 7 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆26Updated 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
- Learning to Perform Local Rewriting for Combinatorial Optimization☆151Updated 5 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆100Updated 2 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆46Updated 5 years ago
- PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers☆41Updated 2 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆379Updated 3 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
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆135Updated 2 years ago
- A branch-and-bound ILP solver☆26Updated 6 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- G2SAT: Learning to Generate SAT Formulas☆49Updated 4 years ago
- Code for the paper "Let’s Make Block Coordinate Descent Go Fast"☆48Updated last year
- Graph Neural Network architecture to solve the decision version of the graph coloring problem (GCP)☆25Updated 5 years ago
- Shortest Path prediction using Graph Convolutional Networks☆26Updated 7 years ago
- Code release for NeurIPS 2019 paper "End to End Learning and Optimization on Graphs"☆91Updated 5 years ago
- PyTorch implementation of NeuroSAT☆28Updated 2 years ago
- Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning☆39Updated last year
- Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"☆39Updated 6 years ago