Optimization models using various solvers
SM Model Optimization: Lagrange and MIP
Stochastic Unit Commitment for Renewable Energy Supply using Lagrangian Decomposition
Branch and Bound Algorithm for the 0/1 Knapsack Problem using Lagrangian Relaxation
Theoretical analysis and implementation in Java of a Branch & Bound for the TSP that exploits the Langrangian relaxation of the 1-Tree to calculate the bounds efficiently.
Dual-Based Procedure and Subgradient method implementations
A python microframework for integer programming lagrangian relaxation
An optimization project about the knapsack problem
The Knapsack Transformation Algorithm (KTA) for solving the single-sink fixed-charge transportation problem (SSFCTP)
Optimizers for/and sklearn compatible Machine Learning models
A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.
Add a description, image, and links to the lagrangian-relaxation topic page so that developers can more easily learn about it.
To associate your repository with the lagrangian-relaxation topic, visit your repo's landing page and select "manage topics."