Approximating the k-splittable capacitated network design problem.
Ehab MorsyPublished in: Discret. Optim. (2016)
Keyphrases
- network design problem
- approximation algorithms
- network design
- network flow problem
- heuristic solution
- branch and bound
- mixed integer programming
- integer programming
- mixed integer
- valid inequalities
- transportation networks
- minimal cost
- lagrangian relaxation
- convex hull
- distributed databases
- traveling salesman problem