An iterative algorithm for the Max-Min knapsack problem with multiple scenarios.
Thekra Al DouriMhand HifiVassilis ZissimopoulosPublished in: Oper. Res. (2021)
Keyphrases
- knapsack problem
- max min
- dynamic programming
- optimal solution
- np hard
- learning algorithm
- simulated annealing
- test problems
- min max
- bicriteria
- computational complexity
- search space
- greedy heuristic
- exact algorithms
- convergence rate
- convex hull
- objective function
- solution space
- exhaustive search
- combinatorial optimization problems
- multistage
- linear programming
- optimization problems
- worst case