Alternatives and similar repositories for CO_ProxyDesign

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

• Graph-COM / Meta_CO
  the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning
  ☆9Updated 2 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆49Updated 3 years ago
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆51Updated last year
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆64Updated 2 years ago
• kaist-silab / meta-sage
  [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…
  ☆10Updated last year
• ai4co / unsupervised-CO-ucom2
  [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
  ☆13Updated 11 months ago
• Thinklab-SJTU / ROCO
  Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…
  ☆20Updated 8 months ago
• DIMESTeam / DIMES
  ☆42Updated last month
• Thinklab-SJTU / PredictiveCO-Benchmark
  [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime
  ☆21Updated 2 months ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆27Updated 3 years ago
• Thinklab-SJTU / HardSATGEN
  [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
  ☆21Updated 2 years ago
• Thinklab-SJTU / T2TCO
  [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization
  ☆63Updated 4 months ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• MIRALab-USTC / L2O-G2MILP
  This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.
  ☆32Updated 8 months ago
• idea-iitd / GCOMB
  ☆35Updated 2 years ago
• Thinklab-SJTU / ML4CO-Bench-101
  ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
  ☆16Updated last month
• ml-jku / DIffUCO
  ☆49Updated 2 weeks ago
• Thinklab-SJTU / NAR-CO-Solver
  Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…
  ☆40Updated 9 months ago
• alstn12088 / LCP
  ☆21Updated 2 years ago
• sungsoo-ahn / learning_what_to_defer
  ☆24Updated 4 years ago
• ai4co / gfacs
  Official repository for GFACS
  ☆31Updated last year
• haotang1995 / IterGNN
  Code for "Towards Scale-Invariant Graph-related Problem Solving by Iterative Homogeneous GNNs" (NeurIPS 2020)
  ☆18Updated 4 years ago
• ml-jku / VAG-CO
  ☆11Updated last year
• ha0ransun / Path-Auxiliary-Sampler
  ☆11Updated 2 years ago
• Thinklab-SJTU / ACM-MILP
  Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…
  ☆12Updated 5 months ago
• HongtengXu / SGWB-Graphon
  Learning Graphons via Structured Gromov-Wasserstein Barycenters
  ☆22Updated 4 years ago
• davidireland3 / LeNSE
  ☆14Updated 2 years ago
• alstn12088 / Sym-NCO
  ☆29Updated last year
• Thinklab-SJTU / ML4CO-Kit
  A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).
  ☆50Updated 2 weeks ago
• FFTYYY / TWIRLS
  The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".
  ☆43Updated 4 years ago