Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem.
Junyoung KimKyungsik LeePublished in: CoRR (2024)
Keyphrases
- knapsack problem
- chance constrained
- dynamic programming
- optimal solution
- convex relaxation
- globally optimal
- cost function
- np hard
- computationally tractable
- search space
- objective function
- exact algorithms
- optimization algorithm
- learning algorithm
- worst case
- computational complexity
- linear programming
- optimization problems