Thinklab-SJTU / ACM-MILPLinks
Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generation
☆13Updated 9 months ago
Alternatives and similar repositories for ACM-MILP
Users that are interested in ACM-MILP are comparing it to the libraries listed below
Sorting:
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 6 months ago
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆60Updated this week
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆23Updated 2 weeks ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆39Updated 4 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆67Updated 3 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated 11 months ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆34Updated last year
- ☆23Updated last year
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆16Updated 3 years ago
- [NeurIPS2024] Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization; [N…☆15Updated 3 months ago
- ☆11Updated last year
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆223Updated last year
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆64Updated 2 years ago
- ☆43Updated 5 months ago
- ☆30Updated last year
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆41Updated last year
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆66Updated 2 years ago
- [Preprint] Graph State Space Convolution (GSSC)☆13Updated last year
- This is the code of DiffILO, an unsupervised learning approach for predicting solutions to Integer Linear Programs (ILPs).☆22Updated 5 months ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆38Updated 6 months ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆50Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆53Updated last year
- Official DGL implementation of "Rethinking High-order Graph Convolutional Networks"☆33Updated 4 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆101Updated 2 years ago
- Official repository for GFACS☆32Updated last year
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆29Updated last year
- [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…☆52Updated 2 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago