Pinpointing the complexity of the interval min-max regret knapsack problem.
Vladimir G. DeinekoGerhard J. WoegingerPublished in: Discret. Optim. (2010)
Keyphrases
- knapsack problem
- min max
- worst case
- combinatorial optimization problems
- optimal solution
- optimization problems
- max min
- np hard
- greedy algorithm
- online learning
- multidimensional knapsack problem
- linear programming relaxation
- exact algorithms
- dynamic programming
- np hard problems
- test problems
- continuous relaxation
- maximum profit
- multiple objectives
- greedy heuristic
- bicriteria
- heuristic solution
- lower bound
- objective function
- machine learning
- decision variables
- decision problems
- upper bound
- evolutionary algorithm