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 4 years ago
• ZHANG-NI / AGFN
  ☆11Updated last month
• lyeskhalil / CORL
  ☆25Updated 3 years ago
• JayMan91 / NeurIPSIntopt
  Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.
  ☆20Updated last year
• 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
• Elizabethxyhu / NeurIPS_Two_Stage_Predict-Optimize
  ☆26Updated last year
• davidireland3 / LeNSE
  ☆15Updated 2 years ago
• sanketkshah / LODLs
  Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"
  ☆28Updated last year
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆36Updated 5 years ago
• yudasong / Reinforcement-Learning-Branch-and-Bound
  ☆17Updated 7 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
• 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
• RAISELab-atUVA / lagrangian-dual-deep-learning
  ☆19Updated 3 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 5 years ago
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 4 years ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• LongPham7 / Distributionally-Robust-Optimization
  Experiments with distributionally robust optimization (DRO) for deep neural networks
  ☆39Updated 6 years ago
• DanieleGammelli / graph-meta-rl-for-amod
  Official implementation of "Graph Meta-Reinforcement Learning for TransferableAutonomous Mobility-on-Demand"
  ☆14Updated 3 years ago
• idea-iitd / GCOMB
  ☆35Updated 2 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
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated last year
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆100Updated 2 years ago
• PredOpt / predopt-benchmarks
  This repository is the the implementation of the JAIR paper: https://doi.org/10.1613/jair.1.15320. This repository provides the codebase …
  ☆49Updated 5 months ago
• WXY1427 / Learn-LNS-policy
  ☆34Updated 2 years ago
• DIMESTeam / DIMES
  ☆42Updated 4 months ago
• VITA-Group / L2O-Training-Techniques
  [NeurIPS 2020 Spotlight Oral] "Training Stronger Baselines for Learning to Optimize", Tianlong Chen*, Weiyi Zhang*, Jingyang Zhou, Shiyu …
  ☆28Updated 3 years ago
• Pointerformer / Pointerformer
  Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem
  ☆39Updated 3 years ago
• Bill-CJB / NHDE
  ☆26Updated 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
• FeiLiu36 / MTNCO
  multi-task learning for routing problem
  ☆20Updated 10 months ago