Alternatives and similar repositories for Reinforcement-Learning-Branch-and-Bound

Users that are interested in Reinforcement-Learning-Branch-and-Bound are comparing it to the libraries listed below

• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 5 years ago
• WXY1427 / Learn-LNS-policy
  ☆31Updated 2 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆38Updated 11 months ago
• water-mirror / DPR
  Dynamic Partial Removal: a Neural Network Heuristic for Large Neighborhood Search on Combinatorial Optimization Problems, by applying dee…
  ☆18Updated 4 years ago
• lascavana / rl2branch
  ☆18Updated 8 months ago
• google-deepmind / neural_lns
  ☆47Updated 3 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
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆26Updated 3 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
• paulorocosta / ai-for-tsp-competition
  This is the official repository of the AI for TSP competition at IJCAI 2021
  ☆24Updated 2 years ago
• paulorocosta / learning-2opt-drl
  Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
  ☆53Updated 4 years ago
• jiang-yuan / Learning-routing-DRO
  ☆21Updated 3 years ago
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆67Updated 3 years ago
• udeshmg / GTA-RL
  Attention based model for learning to solve different routing problems
  ☆40Updated 2 years ago
• liangxinedu / stepwise
  ☆21Updated 3 years ago
• ahottung / EAS
  Efficient Active Search
  ☆50Updated 3 years ago
• temur-kh / pdp-drl-project
  Deep reinforcement approach to solving dynamic pickup and delivery problem
  ☆18Updated 3 years ago
• GitYiheng / ofcourse
  Order Fulfillment by Multi-Agent Reinforcement Learning
  ☆23Updated last year
• jingwenli0312 / Heterogeneous-Attentions-PDP-DRL
  ☆55Updated 2 years ago
• Elizabethxyhu / NeurIPS_Two_Stage_Predict-Optimize
  ☆24Updated last year
• hanxiongwei / L2O-Solver-Papers
  ☆11Updated 5 years ago
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆31Updated 4 years ago
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 4 years ago
• Alekat13 / Deep-Reinforcement-Ant-Colony-Optimization-
  Swarm learning algorithm
  ☆11Updated 4 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 4 years ago
• naver / bq-nco
  ☆40Updated last year
• JayMan91 / NeurIPSIntopt
  Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.
  ☆20Updated last year
• aigerimb / FFEVSS
  ☆10Updated 4 years ago
• yining043 / PDP-N2S
  This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…
  ☆58Updated 2 years ago