A note on upper bounds to the robust knapsack problem with discrete scenarios.
Marc GoerigkPublished in: Ann. Oper. Res. (2014)
Keyphrases
- knapsack problem
- upper bound
- continuous relaxation
- optimal solution
- dynamic programming
- lower bound
- combinatorial optimization problems
- linear programming relaxation
- test problems
- np hard problems
- optimization problems
- upper and lower bounds
- np hard
- exact algorithms
- linear functions
- greedy algorithm
- branch and bound algorithm
- bicriteria
- heuristic solution
- multidimensional knapsack problem
- decision variables
- greedy heuristic
- machine learning
- implicit enumeration
- cutting plane