Alternatives and similar repositories for LOMAR

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

• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆27Updated 3 years ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• Thinklab-SJTU / NAR-CO-Solver
  Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…
  ☆40Updated 9 months ago
• JayMan91 / NeurIPSIntopt
  Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.
  ☆20Updated last year
• Graph-COM / Meta_CO
  the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning
  ☆9Updated 2 years ago
• DIMESTeam / DIMES
  ☆42Updated 2 months ago
• sanketkshah / LODLs
  Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"
  ☆28Updated last year
• Baijiong-Lin / MOML
  [NeurIPS 2021 | AIJ 2024] Multi-Objective Meta Learning
  ☆15Updated 11 months ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 5 years ago
• idea-iitd / GCOMB
  ☆35Updated 2 years ago
• ZHANG-NI / AGFN
  ☆10Updated 4 months ago
• Xi-L / CPL
  Code for ICML2023 Paper: Continuation Path Learning for Homotopy Optimization
  ☆12Updated 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).
  ☆33Updated 5 years ago
• zdhNarsil / GFlowNet-CombOpt
  PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…
  ☆64Updated 2 years ago
• VITA-Group / L2O-Training-Techniques
  [NeurIPS 2020 Spotlight Oral] "Training Stronger Baselines for Learning to Optimize", Tianlong Chen*, Weiyi Zhang*, Jingyang Zhou, Shiyu …
  ☆26Updated 3 years ago
• davidireland3 / LeNSE
  ☆14Updated 2 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆49Updated 3 years ago
• Pointerformer / Pointerformer
  Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem
  ☆39Updated 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
• lyeskhalil / CORL
  ☆25Updated 3 years ago
• LongPham7 / Distributionally-Robust-Optimization
  Experiments with distributionally robust optimization (DRO) for deep neural networks
  ☆38Updated 6 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
• lyeskhalil / mipGNN
  ☆26Updated 4 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
• Bill-CJB / NHDE
  ☆24Updated last year
• longhp1618 / MultiSample-Hypernetworks
  [AAAI-23] Improving Pareto Front Learning via Multi-Sample Hypernetworks
  ☆9Updated 10 months ago
• WXY1427 / Learn-LNS-policy
  ☆32Updated 2 years 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
• RoyalSkye / Routing-CNF
  [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"
  ☆20Updated 7 months ago
• jiang-yuan / Learning-routing-DRO
  ☆21Updated 3 years ago