Redesigning a supply chain network with system disruption using Lagrangian relaxation: a real case study.
Abolghasem Yousefi BabadiAli Bozorgi-AmiriReza Tavakkoli-MoghaddamPublished in: Soft Comput. (2022)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- branch and bound algorithm
- feasible solution
- np hard
- linear programming
- dynamic programming
- lower and upper bounds
- dual decomposition
- column generation
- capacity constraints
- network design problem
- shortest path
- mixed integer programming
- mixed integer program
- relaxation algorithm
- subgradient method
- approximation algorithms
- objective function
- single machine scheduling problem
- supply chain
- lagrangian heuristic
- linear program
- optimization problems
- set covering problem