hanxiongwei / L2O-Solver-Papers

Related projects: ⓘ

• liangxinedu / MDAM
  ☆45Updated 3 years ago
• jiang-yuan / Learning-routing-DRO
  ☆19Updated 2 years ago
• Xi-L / PMOCO
  Code for ICLR2022 Paper: Pareto Set Learning for Neural Multi-objective Combinatorial Optimization
  ☆51Updated 2 years ago
• RoyalSkye / Omni-VRP
  [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"
  ☆38Updated last year
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆65Updated 3 years ago
• liangxinedu / stepwise
  ☆20Updated 3 years ago
• sribdcn / Predict-and-Search_MILP_method
  Predict and search framework for MilP
  ☆37Updated last year
• liangxinedu / NeuroLKH
  ☆66Updated 2 years ago
• paulorocosta / learning-2opt-drl
  Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
  ☆45Updated 3 years ago
• ahottung / EAS
  Efficient Active Search
  ☆46Updated 2 years ago
• WXY1427 / Learn-LNS-policy
  ☆29Updated 2 years ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆79Updated 3 years ago
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆93Updated last year
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 4 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆44Updated 3 years ago
• zhangzizhen / ML-DAM
  ☆21Updated 2 years ago
• wondergo2017 / TSP-HAC
  Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"
  ☆21Updated 2 years ago
• rlopt / l2i
  ☆103Updated 4 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆16Updated 6 years ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆33Updated 4 years ago
• Spider-scnu / TSP
  ☆111Updated last year
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆31Updated 3 weeks ago
• DIMESTeam / DIMES
  ☆38Updated 2 months ago
• yining043 / PDP-N2S
  This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…
  ☆52Updated last year
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆25Updated 3 years ago
• cpwan / RLOR
  Reinforcement learning for operation research problems with OpenAI Gym and CleanRL
  ☆72Updated last year
• yining043 / VRP-DACT
  This repo implements our paper, "Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer", which has be…
  ☆89Updated 3 months ago
• google-deepmind / neural_lns
  ☆39Updated 2 years 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
• naver / bq-nco
  ☆29Updated 10 months ago