JHL-HUST / BandMaxSAT
BandMaxSAT: Multi-armed Bandit for the Local Search MaxSAT Solver
☆12Updated last year
Alternatives and similar repositories for BandMaxSAT:
Users that are interested in BandMaxSAT are comparing it to the libraries listed below
- PyTorch implementation of NeuroSAT☆28Updated last year
- [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks☆35Updated 9 months ago
- A benchmarking suite for maximum independent set solvers.☆49Updated last year
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆29Updated 4 months ago
- Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)☆22Updated 2 years ago
- A Simple CDCL Solver☆28Updated last year
- NLocalSAT; Boosting Local Search with Solution Prediction☆18Updated last year
- SIGMOD 2018: Online Processing Algorithms for Influence Maximization☆22Updated 6 years ago
- ☆48Updated 10 months ago
- ☆37Updated last year
- "GraphArena: Evaluating and Exploring Large Language Models on Graph Computation" in ICLR 2025☆13Updated 5 months ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆44Updated 5 years ago
- Implementation of "ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning" (https://arxiv.org/abs/2…☆24Updated 2 years ago
- An implementation of vdist2vec model in paper A Learning Based Approach to Predict Shortest-Path Distances☆10Updated 2 years ago
- Exact graph edit distance (GED) computation and verification☆55Updated 2 years ago
- Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications☆11Updated 6 years ago
- ☆10Updated 4 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"☆27Updated 8 months ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆48Updated 2 years ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆72Updated last week
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆97Updated last year
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆20Updated last year
- Management of Benchmark Instances and Instance Attributes☆18Updated 3 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆59Updated 3 weeks ago
- BenchTemp: A General Benchmark for Evaluating Temporal Graph Neural Networks☆18Updated 11 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 3 months ago
- ☆150Updated last year
- Open source release from our ICLR 2020 paper, CLN2INV: Learning Loop Invariants with Continuous Logic Networks.☆21Updated 4 years ago
- The original code for SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization (VLDB 2022) and Scalable Decoupling Graph …☆13Updated 11 months ago