hhexiy / scip-dagger
A branch-and-bound ILP solver
☆26Updated 5 years ago
Alternatives and similar repositories for scip-dagger:
Users that are interested in scip-dagger are comparing it to the libraries listed below
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆30Updated 4 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)☆49Updated 3 years ago
- ☆42Updated 3 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆150Updated 5 years ago
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 5 months ago
- ☆16Updated 6 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 5 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆364Updated 3 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆129Updated 2 years ago
- The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'☆84Updated 3 years ago
- ☆24Updated 3 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 5 years ago
- Co-training for Policy Learning☆13Updated 5 years ago
- Parallel Multi-Block ADMM with o(1/k) Convergence☆13Updated 9 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆81Updated 4 years ago
- Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.☆19Updated 9 months ago
- ☆17Updated 4 months ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 2 years ago
- Code implementation for NeurIPS 2019 submission 'Reinforcement Learning for Integer Programming: Learning to Cut'☆35Updated 5 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆30Updated 5 years ago
- Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"☆38Updated 7 months ago
- Code for the paper "Let’s Make Block Coordinate Descent Go Fast"☆46Updated last year
- The repository archives papers regarding the combination of combinatorial optimization and machine learning and corresponding reading not…☆160Updated 4 years ago
- Task-based end-to-end model learning in stochastic optimization☆202Updated 4 years ago
- Adaptive Cut Selection in Mixed-Integer Linear Programming☆13Updated last year
- Extensible Combinatorial Optimization Learning Environments☆335Updated 2 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago