Alternatives and similar repositories for L2O-DiffILO

Users that are interested in L2O-DiffILO are comparing it to the libraries listed below

• Edward-Sun / DIFUSCO
  Code of NeurIPS paper: arxiv.org/abs/2302.08224
  ☆219Updated last year
• Thinklab-SJTU / T2TCO
  [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization
  ☆67Updated 2 months 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
• DIMESTeam / DIMES
  ☆43Updated 4 months ago
• RoyalSkye / Routing-MVMoE
  [ICML 2024] "MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts"
  ☆75Updated 3 months ago
• henry-yeh / GLOP
  [AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time
  ☆93Updated 8 months ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• alstn12088 / Sym-NCO
  ☆30Updated last year
• naver / goal-co
  ☆38Updated 4 months ago
• MIRALab-USTC / L2O-G2MILP
  This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.
  ☆34Updated 11 months ago
• ai4co / reevo
  [NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
  ☆206Updated 4 months ago
• RoyalSkye / Omni-VRP
  [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"
  ☆53Updated 3 months ago
• FeiLiu36 / MTNCO
  multi-task learning for routing problem
  ☆20Updated 10 months ago
• Thinklab-SJTU / ML4CO-Kit
  A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).
  ☆60Updated this week
• 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
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• kaist-silab / equity-transformer
  ☆27Updated last year
• 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
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆43Updated last year
• Thinklab-SJTU / ML4TSPBench
  Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…
  ☆39Updated 4 months ago
• liujl11git / GNN-MILP
  [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…
  ☆52Updated 2 years ago
• xybFight / GNARKD
  PyTorch code for the GNARKD.
  ☆26Updated 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
• ahottung / EAS
  Efficient Active Search
  ☆52Updated 3 years ago
• sribdcn / Predict-and-Search_MILP_method
  Predict and search framework for MilP
  ☆59Updated 2 years ago
• Thinklab-SJTU / ML4CO-Bench-101
  ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
  ☆23Updated 4 months 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
• Thinklab-SJTU / PredictiveCO-Benchmark
  [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime
  ☆23Updated 6 months ago
• yimengmin / UTSP
  code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem
  ☆54Updated last year
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆235Updated 4 years ago