Thinklab-SJTU / ROCO
Implementation of our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs".
☆20Updated 2 months ago
Alternatives and similar repositories for ROCO:
Users that are interested in ROCO are comparing it to the libraries listed below
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆17Updated 2 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆58Updated 5 months ago
- ☆40Updated 6 months ago
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year
- Implementation code for NeurIPS 2024 paper: "Learning to Handle Complex Constraints for Vehicle Routing Problems"☆17Updated last week
- ☆25Updated 11 months ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆34Updated 3 months ago
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆20Updated last year
- ☆23Updated 11 months ago
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆25Updated 10 months ago
- ☆13Updated 2 months ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆25Updated 3 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆29Updated 3 months ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆29Updated 5 months ago
- multi-task learning for routing problem☆13Updated 2 months ago
- ☆30Updated 2 years ago
- PARCO: Parallel AutoRegressive Combinatorial Optimization☆18Updated 3 months ago
- [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More☆13Updated 6 months ago
- ☆21Updated 2 years ago
- ☆19Updated 2 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆15Updated 2 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆95Updated last year
- Official DGL implementation of "Rethinking High-order Graph Convolutional Networks"☆32Updated 3 years ago
- Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"☆21Updated 2 years ago
- ☆25Updated last year
- Official repository for GFACS☆26Updated 8 months ago
- ☆21Updated last year
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆21Updated 2 months ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆61Updated last year
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆46Updated last year