zhaoyu-li / NSNet
[NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"
☆18Updated 2 years ago
Alternatives and similar repositories for NSNet:
Users that are interested in NSNet 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☆34Updated 11 months ago
- Learning local search heuristics for Boolean satisfiability☆37Updated 11 months ago
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 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
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆20Updated last year
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆12Updated 3 months ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆30Updated 6 months ago
- G2SAT: Learning to Generate SAT Formulas☆50Updated 4 years ago
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆41Updated last week
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆61Updated 2 months ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆49Updated 2 years ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated 5 months ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆15Updated 2 years ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆19Updated 2 weeks ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆26Updated 3 years ago
- ☆23Updated last year
- ☆10Updated 2 years ago
- ☆42Updated 2 months ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆45Updated 5 years ago
- ☆23Updated 4 years ago
- Official DGL implementation of "Rethinking High-order Graph Convolutional Networks"☆33Updated 3 years ago
- A Simple CDCL Solver☆28Updated 2 years ago
- NLocalSAT; Boosting Local Search with Solution Prediction☆18Updated last year
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆32Updated last month
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆99Updated last year
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆62Updated last year
- A benchmarking suite for maximum independent set solvers.☆50Updated last year
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆56Updated last year