JHL-HUST / BandMaxSAT
BandMaxSAT: Multi-armed Bandit for the Local Search MaxSAT Solver
☆10Updated last year
Related projects ⓘ
Alternatives and complementary repositories for BandMaxSAT
- [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks☆32Updated 6 months ago
- Learning local search heuristics for Boolean satisfiability☆37Updated 6 months ago
- PyTorch implementation of NeuroSAT☆26Updated last year
- A benchmarking suite for maximum independent set solvers.☆46Updated 9 months ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- NLocalSAT; Boosting Local Search with Solution Prediction☆18Updated last year
- Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)☆20Updated last year
- GLSearch: Maximum Common Subgraph Detection via Learning to Search☆22Updated last year
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 4 years ago
- Exact graph edit distance (GED) computation and verification☆54Updated 2 years ago
- ☆143Updated 9 months ago
- GraphArena: Benchmarking Large Language Models on Graph Computational Problems☆11Updated 2 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆53Updated 3 months ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆27Updated last month
- Management of Benchmark Instances and Instance Attributes☆17Updated 3 weeks ago
- [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"☆19Updated last year
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆43Updated 4 years ago
- ☆21Updated 9 months ago
- ☆47Updated 7 months ago
- VF2 - Subgraph Isomorphism☆45Updated 4 years ago
- ☆10Updated last year
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆44Updated 2 years ago
- Open source release from our ICLR 2020 paper, CLN2INV: Learning Loop Invariants with Continuous Logic Networks.☆21Updated 4 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆121Updated 2 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆93Updated last year
- Representing CP problems as graphs☆16Updated last month
- DISCO: Influence Maximization Meets Graph Embedding and Deep Learning (a.k.a. PIANO)☆11Updated 2 years ago
- Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"☆25Updated 5 months ago
- The original code for SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization (VLDB 2022) and Scalable Decoupling Graph …☆13Updated 8 months ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago