qcappart / learning-DD

Related projects: ⓘ

• 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
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆44Updated 3 years ago
• yunzhuangshen / PB-DFS
  ☆12Updated 3 years ago
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆27Updated 3 years ago
• lyeskhalil / mipGNN
  ☆21Updated 3 years ago
• orrivlin / MinimumVertexCover_DRL
  Learning to solve Minimum Vertex Cover using Graph Convolutional Networks and RL
  ☆74Updated 5 years ago
• alexnowakvila / QAP_pt
  ☆28Updated 4 years ago
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆25Updated 3 years ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆72Updated 2 years ago
• Opt-Mucca / Adaptive-Cutsel-MILP
  Adaptive Cut Selection in Mixed-Integer Linear Programming
  ☆10Updated last year
• hhexiy / scip-dagger
  A branch-and-bound ILP solver
  ☆26Updated 5 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
• google-research / tf-opt
  ☆37Updated last month
• 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
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆43Updated 7 months ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆33Updated 4 years ago
• google-deepmind / neural_lns
  ☆39Updated 2 years ago
• isl-org / NPHard
  Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
  ☆151Updated 2 weeks ago
• tomdbar / eco-dqn
  Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".
  ☆79Updated 3 years ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆18Updated last year
• jparkerholder / ASEBO
  Code to run the ASEBO algorithm from the paper: From Complexity to Simplicity: Adaptive ES-Active Subspaces for Blackbox Optimization... …
  ☆16Updated 3 years ago
• ds4dm / learn2branch-ecole
  Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
  ☆31Updated 3 weeks ago
• corail-research / learning-generic-csp
  Representing CP problems as graphs
  ☆16Updated 2 months ago
• pemami4911 / sinkhorn-policy-gradient.pytorch
  Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"
  ☆39Updated 6 years ago
• DIMESTeam / DIMES
  ☆38Updated 2 months ago
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆26Updated last year
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆125Updated 2 years ago
• lascavana / rl2branch
  ☆15Updated 2 years ago