A matheuristic for a multi-period three-echelon network design problem with temporary capacity acquisition.
Isabel CorreiaM. Teresa MeloPublished in: Comput. Ind. Eng. (2024)
Keyphrases
- multi period
- network design problem
- lot size
- mixed integer programming
- approximation algorithms
- facility location problem
- total cost
- production planning
- planning horizon
- lot sizing
- network design
- mixed integer
- lead time
- multistage
- integer programming
- production cost
- transportation networks
- np hard
- valid inequalities
- branch and bound
- supply chain
- routing problem
- multi item
- lagrangian relaxation
- optimal solution
- special case
- setup cost
- data envelopment analysis
- lower bound
- finite horizon
- travel time
- upper bound
- cutting plane
- primal dual