☆23Feb 8, 2024Updated 2 years ago
Alternatives and similar repositories for ASP
Users that are interested in ASP are comparing it to the libraries listed below
Sorting:
- ☆16Nov 4, 2021Updated 4 years ago
- Official implementation of H-TSP (AAAI2023)☆56Mar 21, 2025Updated 11 months ago
- ☆83Aug 5, 2022Updated 3 years ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆40Nov 17, 2025Updated 3 months ago
- ☆46Apr 30, 2025Updated 10 months ago
- Official implementation of IJCAI'24 paper "Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferra…☆24May 15, 2024Updated last year
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Oct 23, 2024Updated last year
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆34Oct 3, 2024Updated last year
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆41Apr 6, 2025Updated 10 months ago
- ☆15Updated this week
- ☆134Nov 7, 2022Updated 3 years ago
- L2O/NCO codes from CIAM Group at SUSTech, Shenzhen, China☆92May 28, 2025Updated 9 months ago
- Neural Combinatorial Optimization☆94Feb 19, 2026Updated last week
- ☆27Dec 14, 2023Updated 2 years ago
- ☆11Feb 26, 2024Updated 2 years ago
- Code for SIGKDD2025 paper: An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem☆14Jan 28, 2025Updated last year
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Dec 19, 2023Updated 2 years ago
- Official Implementation of the paper: INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer☆26Jul 4, 2024Updated last year
- ☆25Jun 4, 2021Updated 4 years ago
- PyTorch code for the NAR4TSP.☆26Oct 31, 2024Updated last year
- [NeurIPS 2025] PARCO: Parallel AutoRegressive Combinatorial Optimization☆41Dec 3, 2025Updated 2 months ago
- ☆33Nov 27, 2024Updated last year
- This is the official PyTorch implementation for the HLGP algorithm used to solve large-scale CVRP.☆10Feb 13, 2025Updated last year
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Jan 3, 2025Updated last year
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆29Jan 22, 2026Updated last month
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆74Updated this week
- Code for NeurIPS2021 submission "A Surrogate Objective Framework for Prediction+Programming with Soft Constraints"☆13Aug 30, 2021Updated 4 years ago
- Fast and reliable solver for the Optimal Power Flow Problem☆14Dec 12, 2024Updated last year
- Multi-task end-to-end predict-then-optimize☆14Apr 28, 2023Updated 2 years ago
- [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…☆57Aug 11, 2023Updated 2 years ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆241Sep 10, 2024Updated last year
- [AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time☆100Jan 25, 2025Updated last year
- [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing☆86Dec 10, 2021Updated 4 years ago
- code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem☆59May 3, 2024Updated last year
- Predict and search framework for MilP☆66Nov 20, 2022Updated 3 years ago
- ☆21May 3, 2025Updated 9 months ago
- The official implementation of DIG-MILP☆14Oct 27, 2023Updated 2 years ago
- Repo for the paper "Landscape Surrogate Learning Decision Losses for Mathematical Optimization Under Partial Information"☆38Jul 20, 2023Updated 2 years ago
- ☆34Oct 16, 2020Updated 5 years ago