Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes.

Daniel Blado Alejandro Toriello

Published in: SIAM J. Optim. (2019)

Keyphrases

knapsack problem
objective function
optimal solution
optimization problems
combinatorial optimization problems
continuous relaxation
maximum profit
np hard
linear programming relaxation
multidimensional knapsack problem
lower bound
linear programming
greedy algorithm
np hard problems
chance constrained