mit-wu-lab / learning-to-configure-separators
[NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
☆21Updated last year
Alternatives and similar repositories for learning-to-configure-separators:
Users that are interested in learning-to-configure-separators are comparing it to the libraries listed below
- ☆26Updated 3 years ago
- ☆31Updated 2 years ago
- ☆23Updated last year
- ☆38Updated last year
- Predict and search framework for MilP☆52Updated 2 years ago
- Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning☆39Updated last year
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆36Updated 8 months ago
- ☆42Updated 2 months ago
- Efficient Active Search☆49Updated 3 years ago
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆25Updated last month
- This repo implements our paper, "Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt", whic…☆46Updated 9 months ago
- [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"☆50Updated last year
- ☆21Updated 2 years ago
- [AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time☆82Updated 3 months ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 3 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆98Updated 2 years ago
- ☆21Updated 3 years ago
- Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)☆21Updated 2 years ago
- Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem☆36Updated 3 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆31Updated 6 months ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…☆55Updated last year
- ☆16Updated 2 years ago
- Reinforcement Learning for Cut Selection☆11Updated 2 years ago
- L2O/NCO codes from CIAM Group at SUSTech, Shenzhen, China☆76Updated 3 months ago
- The implementation code of our paper "Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation", accepted at…☆52Updated 10 months ago
- ☆46Updated 3 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆26Updated 3 years ago
- This is the official repository of the AI for TSP competition at IJCAI 2021☆24Updated 2 years ago
- Representing CP problems as graphs☆18Updated 4 months ago