Revisiting Lagrangian relaxation for network design.
Bernard GendronPublished in: Discret. Appl. Math. (2019)
Keyphrases
- network design
- lagrangian relaxation
- integer programming
- lower bound
- feasible solution
- network design problem
- np hard
- column generation
- dynamic programming
- facility location
- branch and bound algorithm
- lower and upper bounds
- communication networks
- linear programming
- mixed integer programming
- dual decomposition
- network architecture
- bi objective
- relaxation algorithm
- lagrangian heuristic
- valid inequalities
- optimal solution
- shortest path
- cutting plane algorithm
- upper bound
- dual variables
- subgradient method