Lagrangian decompositions for the two-level FTTx network design problem.
Andreas BleyIvana LjubicOlaf MaurerPublished in: EURO J. Comput. Optim. (2013)
Keyphrases
- network design problem
- lagrangian relaxation
- integer programming
- approximation algorithms
- network design
- benders decomposition
- branch and bound
- branch and bound algorithm
- mixed integer programming
- lower and upper bounds
- column generation
- np hard
- linear programming
- lower bound
- optimal solution
- feasible solution
- dynamic programming
- valid inequalities
- mixed integer
- lagrangian dual
- transportation networks
- minimal cost
- neural network
- lagrangian heuristic
- shortest path
- search algorithm
- objective function