Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem.
Robin H. PearceMichael A. ForbesPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- benders decomposition
- network design problem
- facility location
- network design
- mixed integer
- network flow problem
- lagrangian relaxation
- integer programming
- branch and bound
- mixed integer programming
- convex hull
- valid inequalities
- optimal solution
- lot sizing
- feasible solution
- approximation algorithms
- transportation networks
- linear program
- lp relaxation
- cutting plane
- nonlinear programming
- integer program
- communication networks
- linear programming
- branch and bound algorithm
- minimal cost
- genetic algorithm
- lower and upper bounds
- computationally expensive
- continuous variables