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
  ☆28Updated 4 years ago
• Thinklab-SJTU / NAR-CO-Solver
  Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…
  ☆41Updated last year
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆36Updated 6 years ago
• lyeskhalil / CORL
  ☆25Updated 3 years ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• ZHANG-NI / AGFN
  ☆16Updated last month
• JayMan91 / NeurIPSIntopt
  Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.
  ☆20Updated last year
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 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
• 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
• idea-iitd / GCOMB
  ☆35Updated 2 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆17Updated 7 years ago
• Bill-CJB / NHDE
  ☆27Updated 2 years ago
• sanketkshah / LODLs
  Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"
  ☆31Updated 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 6 years ago
• jingw2 / neural-combinatorial-optimization-rl
  ☆35Updated 5 years ago
• water-mirror / DPR
  Dynamic Partial Removal: a Neural Network Heuristic for Large Neighborhood Search on Combinatorial Optimization Problems, by applying dee…
  ☆20Updated 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…
  ☆67Updated 2 years ago
• xyfffff / rethink_mcts_for_tsp
  [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
  ☆40Updated 7 months ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated last year
• naver / bq-nco
  ☆41Updated last year
• Elizabethxyhu / NeurIPS_Two_Stage_Predict-Optimize
  ☆26Updated last year
• liujl11git / GNN-MILP
  [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…
  ☆53Updated 2 years ago
• FeiLiu36 / MTNCO
  multi-task learning for routing problem
  ☆20Updated last year
• Baijiong-Lin / MOML
  [NeurIPS 2021 | AIJ 2024] Multi-Objective Meta Learning
  ☆15Updated last year
• 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
• aurelienbibaut / DQN_MVC
  Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)
  ☆33Updated 7 years ago
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• JaywayXu / Research-Code
  演化计算/多任务优化/迁移优化
  ☆15Updated 4 years ago
• DIMESTeam / DIMES
  ☆44Updated 6 months ago