alexnowakvila / QAP_pt

Related projects: ⓘ

• isl-org / NPHard
  Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
  ☆151Updated 2 weeks ago
• aurelienbibaut / DQN_MVC
  Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)
  ☆31Updated 6 years ago
• Stalence / erdos_neu
  Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"
  ☆42Updated 2 years ago
• facebookresearch / neural-rewriter
  Learning to Perform Local Rewriting for Combinatorial Optimization
  ☆148Updated 4 years ago
• idea-iitd / GCOMB
  ☆32Updated last year
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆79Updated 3 years ago
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆43Updated 7 months ago
• machine-reasoning-ufrgs / TSP-GNN
  Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…
  ☆114Updated 4 years ago
• louisv123 / COLGE
  ☆36Updated 5 years ago
• qcappart / learning-DD
  Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".
  ☆25Updated 4 years ago
• orrivlin / MinimumVertexCover_DRL
  Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL
  ☆74Updated 5 years ago
• qiang-ma / graph-pointer-network
  ☆151Updated 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)
  ☆31Updated 3 years ago
• RomeoV / ml4co-competition
  Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.
  ☆13Updated 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).
  ☆28Updated 4 years ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated 4 months ago
• hanxiongwei / L2O-Solver-Papers
  ☆11Updated 4 years ago
• Thinklab-SJTU / PPO-BiHyb
  Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".
  ☆93Updated last year
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆27Updated 3 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆44Updated 3 years ago
• ds4dm / learn2branch
  Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)
  ☆342Updated 2 years ago
• DIMESTeam / DIMES
  ☆38Updated 2 months ago
• MichelDeudon / encode-attend-navigate
  ☆110Updated this week
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆125Updated 2 years ago
• Hanjun-Dai / steady_state_embedding
  Learning Steady-States of Iterative Algorithms over Graphs
  ☆39Updated 6 years ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆31Updated 3 weeks ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆25Updated 3 years ago
• lyeskhalil / mipGNN
  ☆21Updated 3 years ago
• MIRALab-USTC / L2O-G2MILP
  This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.
  ☆26Updated 7 months ago
• Spider-scnu / TSP
  ☆111Updated last year