An Integer Programming Based Bound for Locally Repairable Codes.
Anyu WangZhifang ZhangPublished in: CoRR (2014)
Keyphrases
- integer programming
- np hard
- lower bound
- upper bound
- worst case
- lagrangian relaxation
- constraint programming
- network flow
- column generation
- production planning
- set covering problem
- linear programming
- ai planning
- valid inequalities
- reliability analysis
- facility location
- crew scheduling
- inference problems
- set covering
- integer program
- network design problem
- cutting plane
- cutting plane algorithm
- support vector
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- computational complexity
- particle swarm optimization
- set partitioning
- special case