kevinlb1 / CATS

Related projects: ⓘ

• marketdesignresearch / CA-BNE
  Bayes-Nash equilibrium computation of combinatorial auctions
  ☆14Updated 2 years ago
• edxu96 / BendersOptim
  Benders decomposition to solve mixed integer linear programming, especially stochastic programming in seconds!
  ☆24Updated 5 years ago
• sailik1991 / StackelbergEquilibribumSolvers
  Solves a Mixed Integer Linear Program to generate the Stacklberg Equilibrium of a General-sum (+Bayesian) Games.
  ☆35Updated 4 years ago
• wuga214 / PAPER_IJCAI17_HybridPlanning_NeuralNetwork_MILP
  The code of paper "Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming." published on …
  ☆10Updated 6 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆35Updated 2 months ago
• Lyxn / linprog
  Linear Programming in Short
  ☆19Updated 3 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆44Updated 3 years ago
• TueVJ / PyGuEx
  Examples of optimization problems in Python with Gurobi
  ☆28Updated 8 years ago
• vignesh-viswanathan / Bayesian-Stackelberg-Games
  The three algorithms used to solve Bayesian Stackelberg Games have been implemented here.
  ☆25Updated 6 years ago
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆13Updated 3 years ago
• lzw37 / DecompositionAlgorithm
  Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.
  ☆11Updated 6 years ago
• wujianjack / optimizationmodels
  Optimization models using various solvers
  ☆82Updated 7 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆22Updated last year
• coin-or / Dip
  DIP is a decomposition-based solver framework for mixed integer linear programs.
  ☆17Updated 3 years ago
• coin-or / MibS
  A solver for mixed integer bilevel programs
  ☆50Updated last week
• ghackebeil / pybnb
  A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)
  ☆66Updated 3 years ago
• coin-or / GrUMPy
  A Python library for visualizing algorithms for solving mathematical optimization problems.
  ☆63Updated 3 years ago
• nsidn98 / NICE
  Combining Reinforcement Learning with Integer Programming for Robust Scheduling
  ☆25Updated 7 months 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
• PredOpt / predopt-benchmarks
  ☆25Updated 3 weeks ago
• edxu96 / MatrixOptim.jl
  Data-driven decision making under uncertainty using matrices
  ☆31Updated last month
• vidalt / HGS-TDCARP
  Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…
  ☆17Updated 4 years ago
• cswaroop / cplex-samples
  ☆27Updated 8 years ago
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆14Updated last year
• chkwon / Routing.jl
  ☆31Updated this week
• renault-iaa / challenge-roadef-2022
  challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues
  ☆27Updated last year
• google-deepmind / neural_lns
  ☆39Updated 2 years ago
• sburer / ipco-2019-sdp-tutorial
  ☆11Updated 5 years ago
• erelsgl / double-auction
  Implementation and simulation of double auction mechanisms
  ☆9Updated 3 years ago
• yuri-tavares / benders-decomposition
  Implementation of original Benders procedures in Python
  ☆9Updated 5 years ago