Graph-COM / CO_ProxyDesignLinks
The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'
☆17Updated 3 years ago
Alternatives and similar repositories for CO_ProxyDesign
Users that are interested in CO_ProxyDesign are comparing it to the libraries listed below
Sorting:
- the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning☆10Updated 2 years ago
- A benchmarking suite for maximum independent set solvers.☆53Updated last year
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆67Updated 2 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆51Updated 3 years ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 9 months ago
- ☆63Updated 2 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆69Updated 5 months ago
- [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More☆14Updated last year
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆35Updated last month
- ☆23Updated last year
- ☆45Updated 8 months ago
- ☆14Updated 3 years ago
- ☆162Updated last year
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆234Updated last year
- Code for "Towards Scale-Invariant Graph-related Problem Solving by Iterative Homogeneous GNNs" (NeurIPS 2020)☆18Updated 4 years ago
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated 2 years ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated 11 months ago
- This is the code of DiffILO, an unsupervised learning approach for predicting solutions to Integer Linear Programs (ILPs).☆26Updated 2 months ago
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆31Updated last year
- [ICLR 2023 spotlight] "On Representing Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng Lu, W…☆37Updated 3 months ago
- ☆32Updated last year
- Official repository for GFACS☆33Updated last year
- ☆27Updated 4 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆103Updated 2 years ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆40Updated 8 months ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆35Updated last year
- ☆11Updated 2 years ago
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- Code of "Breaking the Limits of Message Passing Graph Neural Networks" paper published in ICML2021☆41Updated 4 years ago