A JuMP extension for Stochastic Dual Dynamic Programming
-
Updated
Feb 27, 2026 - Julia
A JuMP extension for Stochastic Dual Dynamic Programming
Optimization models using various solvers
Repository contains implementation of Bender Decomposition for classical facility/warehause location problem using Python and Gurobi solver.
Benders decomposition with two subproblem | Integer programming
Data-driven decision making under uncertainty using matrices
Benders decomposition to solve mixed integer linear programming, especially stochastic programming in seconds!
Extensible Benders Decomposition in Python
Framework to model two stage stochastic unit commitment optimization problems.
Bender's decomposition for solving Mixed Integer Linear Programs (MILPs).
Modelling and optimization for microgrids, energy hubs, distribution systems and transmission systems
Home healthcare routing problem (HHCRP): replication of an algorithm from literature. Solving the master problem of a benders decomposition model of HHCRP using the mixed integer programming (MIP) method.
Multi-period Home Healthcare Routing Problem (HHCRP) with qualification, synchronization and time windows constraints.
Repository for the course Operations Research 2
Benders Decomposition with gurobipy!
An attempt to write optimization codes from textbooks and match the claimed numerical results
Optimizing Costs for Cloud Computing with Stochastic Programming
Algorithm for distributed traffic signal control
Collection of optimization models
A Modular and Plug-and-Play Framework for Benders Decomposition
A partial Benders decomposition (PBD) for solving choice-based competitive facility location problems (CBCFLP)
Add a description, image, and links to the benders-decomposition topic page so that developers can more easily learn about it.
To associate your repository with the benders-decomposition topic, visit your repo's landing page and select "manage topics."