Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem.
Asaf LevinAleksander VainerPublished in: J. Comb. Optim. (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- np hard
- upper and lower bounds
- exact and approximate
- lower bounding
- branch and bound
- neural network
- quadratic assignment problem
- lower and upper bounds
- worst case
- optimal solution
- vc dimension
- concept class
- data sets
- optimal cost
- set of randomly generated instances