hhexiy / scip-dagger
A branch-and-bound ILP solver
☆26Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for scip-dagger
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆27Updated 3 years ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆72Updated 2 years ago
- Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"☆39Updated 6 years ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆47Updated 3 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 4 years ago
- Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.☆18Updated 6 months ago
- Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"☆36Updated 4 months ago
- ☆40Updated 2 years ago
- Task-based end-to-end model learning in stochastic optimization☆200Updated 3 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆350Updated 2 years ago
- ☆21Updated 3 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆152Updated 2 months ago
- ☆27Updated 2 months ago
- Adaptive Cut Selection in Mixed-Integer Linear Programming☆12Updated last year
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆127Updated 2 years ago
- ☆15Updated last month
- ☆66Updated 6 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆32Updated 3 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆34Updated 5 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆149Updated 4 years ago
- Additive Gaussian Process Bandits - version 1.0☆25Updated 7 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago
- in progress☆107Updated 7 years ago
- ☆28Updated 4 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆32Updated 2 months ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆29Updated 5 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- ☆16Updated 6 years ago
- The repository archives papers regarding the combination of combinatorial optimization and machine learning and corresponding reading not…☆158Updated 4 years ago