Thinklab-SJTU / T2TCO
[NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization
☆62Updated 3 months ago
Alternatives and similar repositories for T2TCO:
Users that are interested in T2TCO are comparing it to the libraries listed below
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆42Updated this week
- ☆42Updated this week
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆33Updated last month
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆198Updated 7 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated 6 months ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆31Updated 7 months ago
- ☆23Updated last year
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆19Updated last month
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆34Updated last month
- ☆25Updated last year
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆64Updated last year
- [ICML 2024] "MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts"☆68Updated 9 months ago
- Official repository for GFACS☆30Updated 11 months ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆50Updated last year
- [AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time☆82Updated 3 months ago
- PARCO: Parallel AutoRegressive Combinatorial Optimization☆20Updated last week
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆12Updated 4 months ago
- ☆22Updated last year
- code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem☆51Updated last year
- multi-task learning for routing problem☆19Updated 6 months ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆98Updated 2 years ago
- This repo implements our paper, "Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt", whic…☆48Updated 9 months ago
- Official implementation of IJCAI'24 paper "Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferra…☆21Updated 11 months ago
- Dataset & models of RRNCO: Real-world Routing NCO☆13Updated last week
- Predict and search framework for MilP☆52Updated 2 years ago
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆55Updated last year
- PyTorch code for the GNARKD.☆23Updated last year
- ☆38Updated last year
- [ICML'24 FM-Wild Oral] RouteFinder: Towards Foundation Models for Vehicle Routing Problems☆67Updated last month
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year