emreyolcu / sat
Learning local search heuristics for Boolean satisfiability
☆37Updated 6 months ago
Related projects ⓘ
Alternatives and complementary repositories for sat
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 4 years ago
- PyTorch implementation of NeuroSAT☆26Updated last year
- G2SAT: Learning to Generate SAT Formulas☆48Updated 4 years ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆43Updated 4 years ago
- [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"☆19Updated last year
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆44Updated 2 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 4 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆24Updated 3 years ago
- ☆10Updated last year
- [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks☆32Updated 6 months ago
- ☆21Updated 3 years ago
- ☆28Updated 4 years ago
- A benchmarking suite for maximum independent set solvers.☆46Updated 9 months ago
- NLocalSAT; Boosting Local Search with Solution Prediction☆18Updated last year
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆47Updated 3 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆15Updated 2 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆32Updated 6 years ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆72Updated 2 years ago
- ☆21Updated 9 months ago
- ☆22Updated 3 years ago
- ☆39Updated 5 months ago
- ☆32Updated last year
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆32Updated 2 months ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆29Updated 5 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆27Updated last month
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆27Updated 3 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆127Updated 2 years ago