MIRALab-USTC / L2O-DiffILOLinks
This is the code of DiffILO, an unsupervised learning approach for predicting solutions to Integer Linear Programs (ILPs).
☆29Updated 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:
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆242Updated last year
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆65Updated 2 years ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆69Updated 6 months ago
- ☆46Updated 8 months ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆66Updated 2 years ago
- ☆23Updated last year
- [ICML 2024] "MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts"☆80Updated 7 months ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆104Updated 2 years ago
- [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…☆56Updated 2 years ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆37Updated 2 months ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 10 months ago
- Official repository for GFACS☆33Updated last year
- ☆32Updated last year
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated last year
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆47Updated last year
- Code for TSP Transformer☆193Updated 4 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆239Updated 4 years ago
- ☆35Updated 3 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆35Updated last year
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆40Updated 9 months ago
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated 2 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆51Updated 3 years ago
- ☆28Updated 2 years ago
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆21Updated last year
- A benchmarking suite for maximum independent set solvers.☆53Updated last year
- ☆26Updated 4 years ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆41Updated last year
- Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning☆45Updated 2 years ago
- codes for the paper "Simulation-guided Beam Search for Neural Combinatorial Optimization"☆42Updated 3 years ago