Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming.
Yeow Meng CheeHan Mao KiahHui ZhangPublished in: IEEE Trans. Inf. Theory (2021)
Keyphrases
- linear programming
- lower bound
- np hard
- objective function
- optimal solution
- upper bound
- linear programming relaxation
- online algorithms
- linear program
- branch and bound algorithm
- storage requirements
- column generation
- lower and upper bounds
- branch and bound
- feasible solution
- lagrangian relaxation
- quadratic programming
- primal dual
- vc dimension
- network flow
- storage and retrieval
- data storage
- worst case
- constraint propagation
- dynamic programming
- error correction
- integer programming
- upper and lower bounds
- computational complexity