Improved Approximation Results for Stochastic Knapsack Problems.
Anand BhalgatAshish GoelSanjeev KhannaPublished in: SODA (2011)
Keyphrases
- knapsack problem
- linear programming relaxation
- combinatorial optimization problems
- dynamic programming
- optimal solution
- discrete random variables
- np hard
- test problems
- optimization problems
- np hard problems
- cutting plane
- approximation algorithms
- bicriteria
- stage stochastic programs
- greedy algorithm
- error bounds
- exact algorithms
- binary variables
- monte carlo
- mixed integer programming
- production planning
- approximation schemes
- implicit enumeration