Approximating some network design problems with node costs.
Guy KortsarzZeev NutovPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- network design problem
- approximation algorithms
- network design
- capacitated fixed charge
- mixed integer programming
- minimal cost
- network flow problem
- branch and bound
- lagrangian relaxation
- transportation networks
- mixed integer
- valid inequalities
- special case
- integer programming
- network architecture
- linear program
- distributed systems