toenshoff / RUN-CSP
☆13Updated last year
Related projects ⓘ
Alternatives and complementary repositories for RUN-CSP
- ☆14Updated 11 months ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆57Updated 6 months ago
- ☆38Updated 3 weeks ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 4 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆127Updated 2 years ago
- ☆21Updated 3 years ago
- Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning☆35Updated last year
- ☆30Updated 2 years ago
- ☆40Updated 2 years ago
- ☆21Updated 9 months ago
- Representing CP problems as graphs☆16Updated last month
- [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing☆78Updated 2 years ago
- ☆12Updated 3 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆24Updated 3 years ago
- Adaptive Cut Selection in Mixed-Integer Linear Programming☆12Updated last year
- ☆15Updated last month
- challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues☆29Updated last year
- Predict and search framework for MilP☆46Updated 2 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆15Updated 2 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆32Updated 2 months ago
- A solver for the generalized assignment problem☆24Updated 4 months ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆47Updated 3 years ago
- [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…☆37Updated last year
- Nutmeg – a MIP and CP branch-and-check solver☆23Updated last year
- ☆20Updated last year
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆29Updated 5 years ago
- [ICML'24 FM-Wild Oral] RouteFinder: Towards Foundation Models for Vehicle Routing Problems☆52Updated last month
- ☆37Updated 5 months ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago
- ☆19Updated 2 years ago