Alternatives and similar repositories for generalization-neural-co-solvers

Users that are interested in generalization-neural-co-solvers are comparing it to the libraries listed below

• zhaoyu-li / NSNet
  [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"
  ☆19Updated 2 years ago
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆53Updated last year
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆28Updated 2 years ago
• NVIDIA / GraphQSat
  Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver
  ☆52Updated 4 years ago
• cornell-zhang / heurigym
  Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization
  ☆51Updated last month
• corail-research / learning-generic-csp
  Representing CP problems as graphs
  ☆19Updated 9 months ago
• shi27feng / transformers.satisfy
  propositional satisfiability problem (SAT) goes neural and deep
  ☆13Updated 4 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆137Updated 3 years ago
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆101Updated 2 years ago
• myxxxsquared / NLocalSAT
  NLocalSAT; Boosting Local Search with Solution Prediction
  ☆18Updated 2 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆50Updated 3 years ago
• zehao-dong / PACE
  ☆17Updated last year
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 4 years ago
• JiaxuanYou / G2SAT
  G2SAT: Learning to Generate SAT Formulas
  ☆49Updated 5 years ago
• MIRALab-USTC / L2O-G2MILP
  This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.
  ☆34Updated last year
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• lyeskhalil / mipGNN
  ☆27Updated 4 years ago
• Edward-Sun / DIFUSCO
  Code of NeurIPS paper: arxiv.org/abs/2302.08224
  ☆223Updated last year
• machine-reasoning-ufrgs / TSP-GNN
  Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…
  ☆117Updated 5 years ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆43Updated last year
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• amazon-science / co-with-gnns-example
  ☆160Updated last year
• Thinklab-SJTU / ML4CO-Bench-101
  ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
  ☆23Updated 2 weeks ago
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• RomeoV / ml4co-competition
  Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.
  ☆13Updated 2 years ago
• hadarshavit / revisiting_satzilla
  SATZilla SAT feature extraction tool
  ☆11Updated last year
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 4 years ago
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆235Updated 4 years ago
• DIMESTeam / DIMES
  ☆43Updated 5 months ago