Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem.
Andreas BleyS. Mehdi HashemiMohsen RezapourPublished in: TAMC (2013)
Keyphrases
- network design problem
- approximation algorithms
- facility location
- facility location problem
- network design
- np hard
- lagrangian relaxation
- integer programming
- mixed integer
- special case
- heuristic solution
- network flow problem
- worst case
- minimum cost
- primal dual
- linear programming
- communication networks
- valid inequalities
- feasible solution
- mixed integer programming
- neural network
- knapsack problem
- np complete
- lower bound