On the Advice Complexity of the Knapsack Problem.
Hans-Joachim BöckenhauerDennis KommRichard KrálovicPeter RossmanithPublished in: LATIN (2012)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- test problems
- optimal solution
- optimization problems
- greedy algorithm
- exact algorithms
- np hard
- multidimensional knapsack problem
- dynamic programming
- computational complexity
- heuristic solution
- cutting plane
- linear programming relaxation
- np hard problems
- decision variables
- bicriteria
- multiple objectives
- worst case
- machine learning
- special case
- maximum profit