Network Design Via Iterative Rounding Of Setpair Relaxations.
Joseph CheriyanSantosh S. VempalaAdrian VettaPublished in: Comb. (2006)
Keyphrases
- network design
- linear programming
- linear programming relaxation
- communication networks
- lower bound
- network architecture
- heuristic solution
- facility location
- network design problem
- np hard
- approximation algorithms
- reverse logistics
- knapsack problem
- linear program
- ip networks
- special case
- artificial neural networks
- optimal solution
- neural network
- databases