Alternatives and similar repositories for scip-dagger

Users that are interested in scip-dagger are comparing it to the libraries listed below

• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆33Updated 4 years ago
• qcappart / learning-DD
  Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".
  ☆27Updated 5 years ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆73Updated 3 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 4 years ago
• pemami4911 / sinkhorn-policy-gradient.pytorch
  Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"
  ☆39Updated 6 years ago
• Opt-Mucca / Adaptive-Cutsel-MILP
  Adaptive Cut Selection in Mixed-Integer Linear Programming
  ☆13Updated last year
• isl-org / NPHard
  Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
  ☆154Updated 9 months ago
• google-deepmind / neural_lns
  ☆47Updated 3 years ago
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• ds4dm / learn2branch
  Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)
  ☆379Updated 3 years ago
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆151Updated 5 years ago
• RomeoV / ml4co-competition
  Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.
  ☆13Updated 2 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆16Updated 6 years ago
• ravi-lanka-4 / CoPiEr
  Co-training for Policy Learning
  ☆13Updated 5 years ago
• lyeskhalil / mipGNN
  ☆26Updated 4 years ago
• nmchaves / admm-for-lp
  Experiments to speed up ADMM optimization algorithm for linear & semidefinite programming
  ☆43Updated 8 years ago
• xijunlee / Learning-to-Optimize-Arxiv
  The repository archives papers regarding the combination of combinatorial optimization and machine learning and corresponding reading not…
  ☆163Updated 4 years ago
• lascavana / rl2branch
  ☆18Updated 8 months ago
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆67Updated 3 years ago
• locuslab / e2e-model-learning
  Task-based end-to-end model learning in stochastic optimization
  ☆208Updated 4 years ago
• chaitjo / learning-paradigms-for-tsp
  Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)
  ☆33Updated 4 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆134Updated 2 years ago
• martinResearch / PySparseLP
  python algorithms to solve sparse linear programming problems
  ☆30Updated last year
• cvxgrp / qcqp
  A CVXPY extension for handling nonconvex QCQP via Suggest-and-Improve framework
  ☆115Updated 5 years ago
• XiaoxiaoGuo / atari_uct
  Upper Confidence Tree Planner for ATARI games
  ☆19Updated 9 years ago
• Spider-scnu / Monte-Carlo-tree-search-for-TSP
  This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).
  ☆33Updated 5 years ago
• yunzhuangshen / PB-DFS
  ☆11Updated 3 years ago
• Lyxn / linprog
  Linear Programming in Short
  ☆18Updated 4 years ago
• alexnowakvila / QAP_pt
  ☆28Updated 5 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆38Updated last year