Thinklab-SJTU / ML4CO-Bench-101Links
ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
☆16Updated last month
Alternatives and similar repositories for ML4CO-Bench-101
Users that are interested in ML4CO-Bench-101 are comparing it to the libraries listed below
Sorting:
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆50Updated 2 weeks ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆21Updated 3 months ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆36Updated last month
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆63Updated 5 months ago
- ☆42Updated last month
- ☆29Updated last year
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated 8 months ago
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆20Updated 7 months ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆37Updated 2 months ago
- [NeurIPS2024] Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization; [N…☆12Updated 3 months ago
- PARCO: Parallel AutoRegressive Combinatorial Optimization☆23Updated last month
- Official repository for GFACS☆31Updated last year
- ☆23Updated last year
- Dataset & models of RRNCO: Real-world Routing NCO☆17Updated last month
- [AAMAS 2025 Oral] CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems☆19Updated last month
- [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More☆13Updated 11 months ago
- ☆21Updated 2 years ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆12Updated 5 months ago
- Official implementation of IJCAI'24 paper "Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferra…☆21Updated last year
- multi-task learning for routing problem☆20Updated 8 months ago
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆27Updated 3 months ago
- Official Implementation of the paper: INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer☆22Updated 11 months ago
- ☆11Updated 11 months ago
- PyTorch code for the GNARKD.☆26Updated last year
- [NeurIPS 2024] Learning to Handle Complex Constraints for Vehicle Routing Problems☆28Updated 2 months ago
- implementation of our IJCAI'24 paper "Cross-Problem Learning for Solving Vehicle Routing Problems".☆16Updated 10 months ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆64Updated 2 years ago
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆21Updated 2 years ago
- ☆36Updated last month