JHL-HUST / BandMaxSAT

Related projects ⓘ

Alternatives and complementary repositories for BandMaxSAT

• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆26Updated last year
• zhaoyu-li / G4SATBench
  [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks
  ☆32Updated 5 months ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated 6 months ago
• shaowei-cai-group / EasySAT
  A Simple CDCL Solver
  ☆26Updated last year
• shaowei-cai-group / ParKissat-RS
  Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)
  ☆20Updated last year
• squareRoot3 / GraphArena
  GraphArena: Benchmarking Large Language Models on Graph Computational Problems
  ☆11Updated 2 months ago
• myxxxsquared / NLocalSAT
  NLocalSAT; Boosting Local Search with Solution Prediction
  ☆18Updated last year
• NVIDIA / GraphQSat
  Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver
  ☆52Updated 4 years ago
• MIRALab-USTC / L2O-G2MILP
  This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.
  ☆27Updated last month
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆46Updated 9 months ago
• triplej0079 / DeepIM
  ☆34Updated last year
• dselsam / neurocore-public
  NeuroCore: Guiding CDCL with Unsat-Core Predictions
  ☆42Updated 4 years ago
• johannaSommer / generalization-neural-co-solvers
  Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"
  ☆14Updated last year
• Dtrycode / ToupleGDD
  Implementation of "ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning" (https://arxiv.org/abs/2…
  ☆20Updated 2 years ago
• amazon-science / co-with-gnns-example
  ☆143Updated 8 months ago
• alvinzhaowei / vdist2vec
  An implementation of vdist2vec model in paper A Learning Based Approach to Predict Shortest-Path Distances
  ☆10Updated 2 years ago
• qtguo / subsim
  ☆10Updated 4 years ago
• cure-lab / DeepGate2
  ☆14Updated last year
• tangj90 / OPIM
  SIGMOD 2018: Online Processing Algorithms for Influence Maximization
  ☆20Updated 6 years ago
• zhaoyu-li / NSNet
  [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"
  ☆19Updated last year
• gdmnl / SCARA-PPR
  The original code for SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization (VLDB 2022) and Scalable Decoupling Graph …
  ☆13Updated 8 months ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆43Updated 2 years ago
• cure-lab / DeepGate
  This is an official implementation for "DeepGate: Learning Neural Representations of Logic Gates".
  ☆19Updated last year
• corail-research / learning-generic-csp
  Representing CP problems as graphs
  ☆16Updated last month
• lihuixidian / PIANO
  DISCO: Influence Maximization Meets Graph Embedding and Deep Learning (a.k.a. PIANO)
  ☆11Updated 2 years ago
• Udopia / gbd
  Management of Benchmark Instances and Instance Attributes
  ☆17Updated 2 weeks ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆70Updated this week
• DerekQXu / GLSearch
  GLSearch: Maximum Common Subgraph Detection via Learning to Search
  ☆22Updated last year
• z11i / pysat
  Simple SAT solver with CDCL implemented in Python
  ☆15Updated last year
• lyeskhalil / mipGNN
  ☆21Updated 3 years ago