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
- Implementation of branch and bound algorithm for maximum clique problem with cplex☆10Updated 7 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆153Updated 4 months ago
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆117Updated 5 years ago
- Learning local search heuristics for Boolean satisfiability☆37Updated 8 months ago
- ☆28Updated 5 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 4 years ago
- G2SAT: Learning to Generate SAT Formulas☆48Updated 4 years ago
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆53Updated 4 years ago
- A branch-and-bound ILP solver☆26Updated 5 years ago
- IPC: A Graph Data Set Compiled from International Planning Competitions☆44Updated 5 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆150Updated 5 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- ☆10Updated last year
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆361Updated 3 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Python code for reproducing the results of Understanding Regularized Spectral Clustering via Graph Conductance☆14Updated 5 years ago
- PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers☆40Updated last year
- A peper list for machine learning models solving combinatorial problems, NP-hard problems and problems in graphs.☆14Updated 4 years ago
- PyTorch implementation of NeuroSAT☆27Updated last year
- ☆156Updated 5 years ago
- Code for the paper 'An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem' (INFORMS Annual Meeting Sessi…☆311Updated 2 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆30Updated 5 years ago
- Genetic Algorithm for the Maximum Clique Problem☆21Updated 4 years ago
- Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL☆76Updated 5 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆32Updated 7 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- ☆16Updated 3 years ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆72Updated 2 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆127Updated 2 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago