A Relaxed FPTAS for Chance-Constrained Knapsack.
Galia ShabtaiDanny RazYuval ShavittPublished in: ISAAC (2018)
Keyphrases
- chance constrained
- knapsack problem
- optimal solution
- np hard
- pareto optimal
- stochastic programming
- approximation algorithms
- dynamic programming
- chance constraints
- optimization problems
- linear programming
- linear program
- chance constrained programming
- robust optimization
- multiple objectives
- vehicle routing problem
- greedy algorithm
- lower bound
- objective function
- search space
- computationally tractable
- artificial intelligence