A new upper bound for the multiple knapsack problem.
Paolo DettiPublished in: Comput. Oper. Res. (2021)
Keyphrases
- knapsack problem
- upper bound
- combinatorial optimization problems
- test problems
- dynamic programming
- optimization problems
- lower bound
- optimal solution
- greedy algorithm
- branch and bound algorithm
- heuristic solution
- worst case
- np hard
- multidimensional knapsack problem
- bicriteria
- greedy heuristic
- maximum profit
- cutting plane
- computational complexity