MIRALab-USTC / L2O-DiffILOLinks
This is the code of DiffILO, an unsupervised learning approach for predicting solutions to Integer Linear Programs (ILPs).
☆20Updated 3 months ago
Alternatives and similar repositories for L2O-DiffILO
Users that are interested in L2O-DiffILO are comparing it to the libraries listed below
Sorting:
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆64Updated last month
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆63Updated 2 years ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆214Updated 11 months ago
- ☆42Updated 3 months ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated 7 months ago
- ☆23Updated last year
- [ICML 2024] "MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts"☆73Updated 2 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated 9 months ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆38Updated 2 months ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆100Updated 2 years ago
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆55Updated this week
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆67Updated 2 years ago
- PyTorch code for the GNARKD.☆26Updated last year
- ☆27Updated last year
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆33Updated 10 months ago
- [AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time☆92Updated 6 months ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆19Updated 2 months ago
- code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem☆52Updated last year
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 4 months ago
- ☆30Updated last year
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆27Updated 4 months ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆41Updated 10 months ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆37Updated 4 months ago
- [NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution☆197Updated 2 months ago
- L2O/NCO codes from CIAM Group at SUSTech, Shenzhen, China☆82Updated 2 months ago
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆20Updated 8 months ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆52Updated 2 months ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆27Updated 4 years ago
- Efficient Active Search☆52Updated 3 years ago
- Predict and search framework for MilP☆58Updated 2 years ago