Alternatives and similar repositories for CL-LNS

Users that are interested in CL-LNS are comparing it to the libraries listed below

• WXY1427 / Learn-LNS-policy
  ☆34Updated 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".
  ☆101Updated 2 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 4 years ago
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆66Updated 2 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆137Updated 3 years ago
• instadeepai / poppy
  Population-Based Reinforcement Learning for Combinatorial Optimization
  ☆81Updated last year
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆235Updated 4 years ago
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• RoyalSkye / Omni-VRP
  [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"
  ☆52Updated 3 months ago
• RoyalSkye / Routing-MVMoE
  [ICML 2024] "MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts"
  ☆75Updated 3 months ago
• naver / goal-co
  ☆38Updated 4 months ago
• DIMESTeam / DIMES
  ☆43Updated 4 months ago
• xbresson / TSP_Transformer
  Code for TSP Transformer
  ☆190Updated 4 years ago
• MIRALab-USTC / L2O-HEM-Torch
  The code of paper Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. Zhihai Wang, Xijun Li,…
  ☆63Updated 2 years ago
• Edward-Sun / DIFUSCO
  Code of NeurIPS paper: arxiv.org/abs/2302.08224
  ☆220Updated last year
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• grimmlab / gumbeldore
  Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…
  ☆27Updated 6 months ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 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
• yd-kwon / MatNet
  codes for the paper "Matrix Encoding Networks for Neural Combinatorial Optimization"
  ☆71Updated 3 years ago
• xyfffff / rethink_mcts_for_tsp
  [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
  ☆38Updated 5 months ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆22Updated last year
• 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).
  ☆34Updated 5 years ago
• naver / bq-nco
  ☆41Updated last year
• mit-wu-lab / learning-to-delegate
  [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing
  ☆85Updated 3 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆17Updated 7 years ago
• Thinklab-SJTU / NAR-CO-Solver
  Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…
  ☆41Updated 11 months ago
• ahottung / EAS
  Efficient Active Search
  ☆52Updated 3 years ago
• Spider-scnu / TSP
  ☆131Updated 2 years ago
• wouterkool / dpdp
  DPDP
  ☆101Updated 2 years ago