Alternatives and similar repositories for NSNet

Users that are interested in NSNet are comparing it to the libraries listed below

• NVIDIA / GraphQSat
  Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver
  ☆52Updated 5 years ago
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆28Updated 2 years ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• zhaoyu-li / G4SATBench
  [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks
  ☆36Updated last year
• johannaSommer / generalization-neural-co-solvers
  Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"
  ☆14Updated 2 years ago
• JiaxuanYou / G2SAT
  G2SAT: Learning to Generate SAT Formulas
  ☆49Updated 5 years ago
• Thinklab-SJTU / HardSATGEN
  [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
  ☆22Updated 2 years ago
• myxxxsquared / NLocalSAT
  NLocalSAT; Boosting Local Search with Solution Prediction
  ☆18Updated 2 years ago
• shaowei-cai-group / EasySAT
  A Simple CDCL Solver
  ☆33Updated 2 years ago
• dselsam / neurocore-public
  NeuroCore: Guiding CDCL with Unsat-Core Predictions
  ☆46Updated 5 years ago
• Gy-Hu / AIG2INV
  DeepIC3: Guiding IC3 Algorithms by Graph Neural Network Clause Prediction (ASP-DAC 2024)
  ☆11Updated last year
• JKomp / AIGER
  Python version of tools to work with AIG formatted files
  ☆12Updated 5 months ago
• hadarshavit / revisiting_satzilla
  SATZilla SAT feature extraction tool
  ☆11Updated last year
• Thinklab-SJTU / ACM-MILP
  Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…
  ☆13Updated 9 months ago
• shi27feng / transformers.satisfy
  propositional satisfiability problem (SAT) goes neural and deep
  ☆13Updated 4 years ago
• cornell-zhang / heurigym
  Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization
  ☆51Updated last month
• Thinklab-SJTU / PredictiveCO-Benchmark
  [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime
  ☆23Updated 7 months ago
• mvcisback / py-aiger
  py-aiger: A python library for manipulating sequential and combinatorial circuits encoded using `and` & `inverter` gates (AIGs).
  ☆48Updated 10 months ago
• YiwenAI / AutoSAT
  ☆22Updated 10 months ago
• Edward-Sun / DIFUSCO
  Code of NeurIPS paper: arxiv.org/abs/2302.08224
  ☆224Updated last year
• Thinklab-SJTU / ML4CO-Bench-101
  ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
  ☆31Updated last week
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆151Updated 5 years ago
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆53Updated last year
• Thinklab-SJTU / ML4TSPBench
  Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…
  ☆45Updated 5 months ago
• zehao-dong / PACE
  ☆17Updated last year
• Thinklab-SJTU / ML4CO-Kit
  A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).
  ☆69Updated last week
• cure-lab / DeepGate2
  ☆15Updated 2 years ago
• krzhu / abc_py
  Simple Python interface for ABC
  ☆25Updated 2 years ago
• Chenghao-Yang / awesome-ml4ls
  Awesome machine learning for logic synthesis
  ☆29Updated 3 years ago
• Graph-COM / CO_ProxyDesign
  The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'
  ☆16Updated 3 years ago