Thinklab-SJTU / ML4TSPBenchLinks
Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search".
☆45Updated 5 months ago
Alternatives and similar repositories for ML4TSPBench
Users that are interested in ML4TSPBench are comparing it to the libraries listed below
Sorting:
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆69Updated last week
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆32Updated 3 weeks ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆68Updated 4 months ago
- [NeurIPS2024] Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization; [N…☆18Updated 4 months ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated 10 months ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 7 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated last year
- ☆44Updated 6 months ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆227Updated last year
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆40Updated 7 months ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆67Updated 2 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆35Updated last year
- ☆30Updated last year
- Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization☆30Updated 3 months ago
- ☆23Updated last year
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem☆56Updated last year
- ☆13Updated 9 months ago
- Official repository for GFACS☆33Updated last year
- [ICML 2024] "MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts"☆80Updated 5 months ago
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year
- [NeurIPS 2025] PARCO: Parallel AutoRegressive Combinatorial Optimization☆32Updated last week
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆65Updated 2 years ago
- This is the code of DiffILO, an unsupervised learning approach for predicting solutions to Integer Linear Programs (ILPs).☆24Updated 3 weeks ago
- [NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution☆222Updated 6 months ago
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆21Updated last year
- [AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time☆97Updated 9 months ago
- Evolution of Heuristics☆233Updated 2 months ago
- [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More☆14Updated last year
- The LLMOPT project offers a comprehensive set of resources, including the model, dataset, training framework, and inference code, enablin…☆105Updated 6 months ago