On generalizations of network design problems with degree bounds.
Nikhil BansalRohit KhandekarJochen KönemannViswanath NagarajanBritta PeisPublished in: Math. Program. (2013)
Keyphrases
- network design problem
- network design
- approximation algorithms
- upper bound
- capacitated fixed charge
- lower bound
- worst case
- lower and upper bounds
- minimal cost
- branch and bound
- mixed integer programming
- transportation networks
- network flow problem
- mixed integer
- valid inequalities
- dynamic programming
- network flow
- bayesian networks