A well-solvable special case of the bounded knapsack problem.
Vladimir G. DeinekoGerhard J. WoegingerPublished in: Oper. Res. Lett. (2011)
Keyphrases
- knapsack problem
- special case
- np hard
- combinatorial optimization problems
- approximation algorithms
- optimization problems
- dynamic programming
- exact algorithms
- computational complexity
- test problems
- optimal solution
- multidimensional knapsack problem
- linear programming relaxation
- bicriteria
- np complete
- np hard problems
- cutting plane
- greedy heuristic
- linear program
- greedy algorithm
- multiple objectives
- maximum profit
- implicit enumeration
- worst case
- linear programming
- lp relaxation
- decision variables
- lower bound
- heuristic solution
- scheduling problem
- integer programming
- continuous relaxation