Thinklab-SJTU / ROCOLinks
Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs".
☆20Updated last year
Alternatives and similar repositories for ROCO
Users that are interested in ROCO are comparing it to the libraries listed below
Sorting:
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 10 months ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated last year
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆70Updated 7 months ago
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆74Updated last month
- ☆46Updated 9 months ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆39Updated 2 months ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆44Updated 8 months ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆41Updated last year
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated 2 years ago
- ☆32Updated 2 years ago
- ☆23Updated 2 years ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆66Updated 2 years ago
- Awesome machine learning for temporal point processes papers.☆22Updated 3 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆104Updated 2 years ago
- Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"☆23Updated 3 years ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆41Updated 10 months ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆241Updated last year
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆34Updated last year
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆65Updated 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
- ☆35Updated 3 years ago
- ☆43Updated 8 months ago
- ☆14Updated last year
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆32Updated last year
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- multi-task learning for routing problem☆22Updated 2 months ago
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- Official repository for GFACS☆33Updated last year
- [NeurIPS 2025] PARCO: Parallel AutoRegressive Combinatorial Optimization☆38Updated 2 months ago
- ☆83Updated 3 years ago