Hard Capacitated Set Cover and Uncapacitated Geometric Set Cover.
Rahil SharmaPublished in: CoRR (2016)
Keyphrases
- set cover
- approximation algorithms
- network design problem
- np hard
- network flow
- facility location problem
- capacity constraints
- lot sizing
- greedy algorithm
- greedy heuristics
- network flow problem
- greedy heuristic
- minimum cost
- fixed charge
- worst case
- special case
- lagrangian relaxation
- facility location
- linear programming
- integer programming
- network design
- primal dual
- multi item
- lower bound
- computational complexity
- neural network
- location problems
- transportation problem
- vehicle routing problem
- solution space
- multistage