Alternatives and similar repositories for LOMAR

Users that are interested in LOMAR are comparing it to the libraries listed below

• lyeskhalil / CORL
  ☆25Updated 3 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 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
• Baijiong-Lin / MOML
  [NeurIPS 2021 | AIJ 2024] Multi-Objective Meta Learning
  ☆17Updated last year
• Thinklab-SJTU / NAR-CO-Solver
  Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…
  ☆41Updated last year
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆50Updated 3 years ago
• Graph-COM / Meta_CO
  the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning
  ☆10Updated 2 years ago
• sanketkshah / LODLs
  Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"
  ☆31Updated last year
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 6 years ago
• DIMESTeam / DIMES
  ☆45Updated 7 months ago
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆67Updated 2 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).
  ☆34Updated 6 years ago
• ZHANG-NI / AGFN
  ☆17Updated 2 months ago
• kaist-silab / meta-sage
  [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…
  ☆10Updated last year
• thanhnguyentang / offline_neural_bandits
  An official JAX-based code for our NeuraLCB paper, "Offline Neural Contextual Bandits: Pessimism, Optimization and Generalization", ICLR…
  ☆13Updated 3 years ago
• Bill-CJB / NHDE
  ☆26Updated 2 years ago
• Pointerformer / Pointerformer
  Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem
  ☆42Updated 3 years ago
• naver / goal-co
  ☆42Updated 6 months ago
• davidireland3 / LeNSE
  ☆14Updated 3 years ago
• ruchtem / cosmos
  This is the official implementation for COSMOS: a method to learn Pareto fronts that scales to large datasets and deep models.
  ☆39Updated 4 years ago
• Thinklab-SJTU / ROCO
  Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…
  ☆20Updated last year
• xyfffff / rethink_mcts_for_tsp
  [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
  ☆40Updated 8 months ago
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆15Updated 4 years ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• fahrbach / edge-weighted-online-bipartite-matching
  Edge-weighted online bipartite matching (JACM 2022)
  ☆12Updated 2 years ago
• idea-iitd / GCOMB
  ☆36Updated 2 years ago
• ai4co / unsupervised-CO-ucom2
  [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
  ☆14Updated last year
• FeiLiu36 / MTNCO
  multi-task learning for routing problem
  ☆20Updated last week