ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
☆45Nov 17, 2025Updated 5 months ago
Alternatives and similar repositories for ML4CO-Bench-101
Users that are interested in ML4CO-Bench-101 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆77Apr 28, 2026Updated last week
- Official implementation of "COExpander: Adaptive Solution Expansion for Combinatorial Optimization".☆24Jun 28, 2025Updated 10 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆73Jul 2, 2025Updated 10 months ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆45May 20, 2025Updated 11 months ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆24Mar 27, 2025Updated last year
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ☆47Apr 30, 2025Updated last year
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆41Apr 6, 2025Updated last year
- ☆35Feb 20, 2026Updated 2 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Oct 23, 2024Updated last year
- [NeurIPS 2025] PARCO: Parallel AutoRegressive Combinatorial Optimization☆51Dec 3, 2025Updated 5 months ago
- Official Implementation of the paper: INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer☆27Jul 4, 2024Updated last year
- [AAMAS 2025 Oral] CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems☆32Dec 3, 2025Updated 5 months ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆41Sep 27, 2024Updated last year
- Official implementation of Our NeurIPS 2024 Paper "Boundary Matters: A Bi-Level Active Finetuning Method"☆14Feb 11, 2025Updated last year
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆21Nov 16, 2024Updated last year
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆14Jan 3, 2025Updated last year
- code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem☆59May 3, 2024Updated 2 years ago
- Code for SIGKDD2025 paper: An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem☆14Jan 28, 2025Updated last year