Skip to content

Latest commit

 

History

History
7 lines (6 loc) · 442 Bytes

README.md

File metadata and controls

7 lines (6 loc) · 442 Bytes

Discrete Optimization

This is a github repository for codes related to discrete optimization algorithms. This includes the following:

  • Subgradient Method (Uncapacitated Facility Location)
  • Dantzig-Wolfe Decomposition solved using Column generation (Cutting stock problem and Shortest path with resource constraints problem)
  • Benders Decomposition (Uncapacitated Facility Location)
  • Knapsack Cover Inequalities Cutting Plane Algorithm