Approximating the k-Splittable Capacitated Network Design Problem.
Ehab MorsyPublished in: SOFSEM (2013)
Keyphrases
- network design problem
- network design
- approximation algorithms
- network flow problem
- branch and bound
- heuristic solution
- transportation networks
- minimal cost
- mixed integer programming
- mixed integer
- integer programming
- lagrangian relaxation
- np hard
- special case
- minimum cost
- lower bound
- lot sizing
- optimization problems
- worst case
- facility location
- dynamic programming