Alternatives and similar repositories for ml4co-competition

Users that are interested in ml4co-competition are comparing it to the libraries listed below

• DIMESTeam / DIMES
  ☆42Updated last month
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆26Updated 3 years ago
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆31Updated 4 years ago
• lyeskhalil / mipGNN
  ☆26Updated 4 years ago
• WXY1427 / Learn-LNS-policy
  ☆31Updated 2 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆135Updated 2 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆50Updated 4 years ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆73Updated 3 years ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆38Updated 9 months 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
• 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
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 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).
  ☆33Updated 5 years ago
• google-deepmind / neural_lns
  ☆47Updated 3 years ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• naver / bq-nco
  ☆40Updated last year
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆22Updated last year
• alstn12088 / LCP
  ☆21Updated 2 years ago
• johannaSommer / generalization-neural-co-solvers
  Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"
  ☆14Updated 2 years ago
• facebookresearch / CL-LNS
  Code repo for ICML'23 Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning
  ☆39Updated last year
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆22Updated 2 years ago
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• 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
• martius-lab / blackbox-differentiation-combinatorial-solvers
  ☆22Updated 3 years ago
• lyeskhalil / CORL
  ☆25Updated 2 years ago
• ha0ransun / Path-Auxiliary-Sampler
  ☆11Updated 2 years ago
• yunzhuangshen / PB-DFS
  ☆11Updated 3 years ago
• wouterkool / dpdp
  DPDP
  ☆100Updated 2 years ago
• alstn12088 / Sym-NCO
  ☆26Updated last year
• google-research / tf-opt
  ☆39Updated 2 months ago