kaist-silab / meta-sageLinks
[ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization
☆10Updated last year
Alternatives and similar repositories for meta-sage
Users that are interested in meta-sage are comparing it to the libraries listed below
Sorting:
- [AAMAS 2025 Oral] CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems☆19Updated 2 weeks ago
- ☆21Updated 2 years ago
- ☆26Updated last year
- ☆25Updated last year
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆19Updated 6 months ago
- PARCO: Parallel AutoRegressive Combinatorial Optimization☆22Updated last month
- ☆42Updated last month
- ☆23Updated last year
- ☆21Updated 3 years ago
- Official repository for GFACS☆30Updated last year
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆27Updated 2 months ago
- Dataset & models of RRNCO: Real-world Routing NCO☆16Updated 3 weeks ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆37Updated 2 months ago
- Official implementation of IJCAI'24 paper "Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferra…☆21Updated last year
- ☆40Updated last year
- multi-task learning for routing problem☆20Updated 7 months ago
- PyTorch code for the NAR4TSP.☆23Updated 7 months ago
- [NeurIPS 2024] Learning to Handle Complex Constraints for Vehicle Routing Problems☆27Updated 2 months ago
- ☆34Updated 3 weeks ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆51Updated this week
- Official Implementation of the paper: INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer☆20Updated 11 months ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆16Updated 2 weeks ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆26Updated 3 years ago
- PyTorch code for the GNARKD.☆25Updated last year
- codes for the paper "Simulation-guided Beam Search for Neural Combinatorial Optimization"☆37Updated 2 years ago
- ☆9Updated 3 months ago
- [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More☆13Updated 10 months ago
- Efficient Active Search☆50Updated 3 years ago
- This repo implements our paper, "Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt", whic…☆50Updated 10 months ago
- ☆10Updated last month