The online knapsack problem: Advice and randomization.
Hans-Joachim BöckenhauerDennis KommRichard KrálovicPeter RossmanithPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- exact algorithms
- multidimensional knapsack problem
- np hard
- linear programming relaxation
- test problems
- dynamic programming
- online learning
- np hard problems
- greedy algorithm
- cutting plane
- maximum profit
- multiple objectives
- privacy preserving
- bicriteria
- decision variables
- continuous relaxation
- heuristic solution