An Integer Programming-Based Bound for Locally Repairable Codes.
Anyu WangZhifang ZhangPublished in: IEEE Trans. Inf. Theory (2015)
Keyphrases
- integer programming
- np hard
- lower bound
- upper bound
- linear programming
- constraint programming
- ai planning
- lagrangian relaxation
- reliability analysis
- set covering problem
- worst case
- column generation
- transportation problem
- dantzig wolfe decomposition
- facility location
- valid inequalities
- network flow
- production planning
- lp relaxation
- set covering
- crew scheduling
- cutting plane algorithm
- vehicle routing problem with time windows
- cutting plane