Alternatives and similar repositories for robust-optimization

Users that are interested in robust-optimization are comparing it to the libraries listed below

• singfie / Data-Driven-Optimization
  A repository holding methods from data-driven-optimization used in data science and operations research including sample average approxim…
  ☆21Updated 4 years ago
• WenYuZhi / LagrangianRelaxationQIP
  Lagrangian Relaxation approach solve QIP
  ☆68Updated 4 years ago
• TueVJ / PyGuEx
  Examples of optimization problems in Python with Gurobi
  ☆28Updated 9 years ago
• ankurzing / bleaq2
  Bilevel Optimization Algorithm
  ☆40Updated 2 years ago
• jramak / dual-adp-suc
  Code / data for the paper "A Dual Approximate Dynamic Programming Approach for Multi-stage Stochastic Unit Commitment" http://www.optimiz…
  ☆42Updated 5 years ago
• HaikoEitzen / ea_m2-2e-vrp
  Evolutionary Algorithm (EA) for the Multi-Objective Multi-Commodity Two-Echelon Vehicle Routing Problem (M2-2E-VRP) with Heterogeneous Fl…
  ☆22Updated 7 years ago
• sometimesstudy / two-stage-robust-optimization
  Two stage robust optimization using a column-and-constraint generation (C&CG) method
  ☆53Updated last year
• Prinway / Distributionally-Robust-Optimization-Notes
  Notes for Distributionally Robust Optimization (DRO) 分布鲁棒优化学习笔记
  ☆46Updated 2 years ago
• goerigk / RO-DNN
  Data and code for the paper Data-Driven Robust Optimization using Unsupervised Deep Learning written by Marc Goerigk and Jannis Kurtz
  ☆23Updated 3 years ago
• yuzhenfeng2002 / Multi-Commodity-Network-Flow
  Using Dantzig-Wolfe (DW) decomposition algorithm to solve MCNF(Multi Commodity Network Flow) problem. Final project for the course of (la…
  ☆21Updated 2 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆38Updated 10 months ago
• PhilippBrendel / bevrp
  This repository contains code related to solving and visualizing the Bi-Directional Electric Vehicle Routing Problem (B-EVRP) as well as …
  ☆18Updated 3 years ago
• stefdeli / Data-driven-Adaptive-Benders-Decomposition
  Data-driven Adaptive Benders Decomposition for the Stochastic Unit Commitment Problem: Python codes & Case study data
  ☆31Updated 5 years ago
• zhengang-zhong / distributionally_robust_optimization
  ☆36Updated 3 years ago
• jiedxu / BendersOptim
  Benders decomposition to solve mixed integer linear programming, especially stochastic programming in seconds!
  ☆24Updated 5 years ago
• mitchopt / Combining-Optimization-and-Simulation-Using-Logic-Based-Benders-Decomposition
  ☆31Updated last year
• xb00dx / ConvertChanceConstraint-ccc
  ConvertChanceConstraint (ccc): a Matlab toolbox for Chance-constrained Optimization
  ☆59Updated 5 years ago
• WenYuZhi / team-learning-rl
  运筹OR帷幄 强化学习学习小组
  ☆25Updated 4 years ago
• pengxiang-liu / benders-decomposition-in-power-system
  Application of Benders decomposition in power systems
  ☆82Updated 5 years ago
• grzegorz-siekaniec / benders-decomposition-gurobi
  Repository contains implementation of Bender Decomposition for classical facility/warehause location problem using Python and Gurobi solv…
  ☆51Updated 3 years ago
• isaac0821 / BendersDecomposition
  Learning Benders Decomposition by Coding
  ☆31Updated 3 years ago
• erudnick-cohen / SGLRO-Robust-Optimization
  Robust optimization algorithm for non-convex optimization problems containing uncertainty
  ☆27Updated 4 years ago
• mahdims / Benders-decomposition
  Benders decomposition with two subproblem | Integer programming
  ☆45Updated 2 years ago
• selvi-aras / convex-max
  Data and codes of the paper "Convex Maximization via Adjustable Robust Optimization"
  ☆18Updated 2 years ago
• wujianjack / optimizationmodels
  Optimization models using various solvers
  ☆93Updated 7 years ago
• MarcosChindelar / Bi-Level
  A Variable Neighborhood Descent with Ant Colony Optimization to Solve a Bilevel Problem with Station Location and Vehicles Routing
  ☆20Updated 2 years ago
• raviagrwl420 / variable-selection
  Variable Selection for Branching in Mixed Integer Linear Programming (MILP)
  ☆6Updated 5 years ago
• RahmanKhorramfar91 / Integer-Benders-for-Stochastic-Programming
  Implementation of Integer bender's cut for SP proposed by Laporte et al.
  ☆10Updated 5 years ago
• TsMikeLiu / CCG_two-stage-RO_toy-case
  Using C&CG to solve two-stage robust optimization
  ☆18Updated 2 years ago
• natetsang / optimizing-power-dispatch
  This project utilizes convex optimization for optimal dispatch of power systems using convex DistFlow equations and cvxpy.
  ☆28Updated 6 years ago