Alternatives and similar repositories for aaai_melding_code:

Users that are interested in aaai_melding_code are comparing it to the libraries listed below

• 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 …
  ☆35Updated last week
• JayMan91 / NeurIPSIntopt
  Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.
  ☆19Updated 10 months ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆38Updated 8 months 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
• Elizabethxyhu / NeurIPS_Two_Stage_Predict-Optimize
  ☆24Updated last year
• lyeskhalil / mipGNN
  ☆24Updated 3 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆49Updated 3 years ago
• rtm2130 / SPOTree
  ☆33Updated 4 years ago
• google-deepmind / neural_lns
  ☆44Updated 3 years ago
• RomeoV / ml4co-competition
  Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.
  ☆13Updated 2 years ago
• nsidn98 / NICE
  Combining Reinforcement Learning with Integer Programming for Robust Scheduling
  ☆26Updated last year
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆13Updated 3 years ago
• yunzhuangshen / PB-DFS
  ☆11Updated 3 years ago
• khalil-research / Neur2RO
  ☆25Updated 3 months ago
• D3M-Research-Group / odtlearn
  A package for tree-based statistical estimation and inference using optimal decision trees.
  ☆40Updated 8 months ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆21Updated 2 years ago
• facebookresearch / SurCo
  Repo for ICML'23 paper SurCo Learning Linear Surrogates For Combinatorial Nonlinear Optimization Problems
  ☆18Updated last year
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆68Updated 3 years ago
• LongPham7 / Distributionally-Robust-Optimization
  Experiments with distributionally robust optimization (DRO) for deep neural networks
  ☆35Updated 5 years ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆21Updated last year
• WXY1427 / Learn-LNS-policy
  ☆31Updated 2 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆130Updated 2 years ago
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• rkimura47 / cmu-comp-or
  A series of tutorials for conducting computational experiments with optimization solvers
  ☆89Updated 10 months ago
• hhexiy / scip-dagger
  A branch-and-bound ILP solver
  ☆26Updated 5 years ago
• martius-lab / blackbox-differentiation-combinatorial-solvers
  ☆22Updated 3 years ago
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆102Updated 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
• 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).
  ☆32Updated 5 years ago
• qiang-ma / HRL-for-combinatorial-optimization
  Hierarchical deep reinforcement learning for combinatorial optimization problem
  ☆35Updated 5 years ago