A new Lagrangian-Benders approach for a concave cost supply chain network design problem.
Ahmed SaifAli KeyvandarianSamir ElhedhliPublished in: INFOR Inf. Syst. Oper. Res. (2021)
Keyphrases
- distribution centers
- network design problem
- benders decomposition
- supply chain
- lagrangian relaxation
- minimal cost
- approximation algorithms
- network design
- minimum cost
- branch and bound
- mixed integer
- np hard
- mixed integer programming
- supply chain management
- cost savings
- integer programming
- optimal solution
- lower bound
- linear programming
- valid inequalities
- column generation
- lower and upper bounds
- branch and bound algorithm
- feasible solution
- transportation networks
- special case
- objective function
- dynamic programming
- search algorithm
- customer demand
- demand points
- exact solution
- genetic algorithm