Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming.
Yeow Meng CheeHan Mao KiahHui ZhangPublished in: ISIT (2019)
Keyphrases
- linear programming
- lower bound
- np hard
- objective function
- optimal solution
- upper bound
- linear programming relaxation
- online algorithms
- branch and bound algorithm
- data storage
- linear program
- branch and bound
- dynamic programming
- storage requirements
- error correction
- lower and upper bounds
- primal dual
- lagrangian relaxation
- feasible solution
- quadratic programming
- storage and retrieval
- special case
- upper and lower bounds
- batch mode
- vc dimension
- worst case
- minimum cost
- integer programming
- file system
- cutting plane
- valid inequalities
- approximation algorithms
- scheduling problem