On Generalizations of Network Design Problems with Degree Bounds
Nikhil BansalRohit KhandekarJochen KönemannViswanath NagarajanBritta PeisPublished in: CoRR (2010)
Keyphrases
- network design problem
- approximation algorithms
- network design
- upper bound
- capacitated fixed charge
- worst case
- mixed integer
- mixed integer programming
- lower bound
- branch and bound
- minimal cost
- network flow problem
- valid inequalities
- lower and upper bounds
- integer programming
- lagrangian relaxation
- transportation networks
- markov random field
- probabilistic model