A distributed approximation approach for solving the sustainable supply chain network design problem.
Yuhan GuoFangxia HuHamid AllaouiYoussef BoulaksilPublished in: Int. J. Prod. Res. (2019)
Keyphrases
- supply chain
- distribution centers
- network design problem
- approximation algorithms
- supply chain management
- network design
- branch and bound
- bullwhip effect
- np hard
- transportation networks
- minimal cost
- lead time
- transportation problem
- lagrangian relaxation
- special case
- integer programming
- decision making
- mixed integer
- valid inequalities
- service level
- lp relaxation
- upper bound
- combinatorial optimization
- linear programming
- mixed integer programming
- worst case
- branch and bound algorithm
- optimization problems