An FPTAS for Stochastic Unbounded Min-Knapsack Problem.
Zhihao JiangHaoyu ZhaoPublished in: CoRR (2019)
Keyphrases
- knapsack problem
- chance constrained
- combinatorial optimization problems
- optimal solution
- dynamic programming
- test problems
- approximation algorithms
- linear programming relaxation
- exact algorithms
- optimization problems
- multidimensional knapsack problem
- np hard
- greedy algorithm
- production planning
- np hard problems
- continuous relaxation
- greedy heuristic
- bicriteria
- heuristic solution
- decision variables
- multiple objectives
- implicit enumeration
- neural network
- linear programming