Knapsack Secretary Through Boosting.
Andreas AbelsLeon LadewigKevin SchewiorMoritz StinzendörferPublished in: CoRR (2022)
Keyphrases
- knapsack problem
- dynamic programming
- feature selection
- optimal solution
- upper bound
- ensemble methods
- base classifiers
- learning algorithm
- computer vision
- feasible solution
- multiple choice
- weak learners
- boosting algorithms
- greedy heuristic
- real time
- packing problem
- ensemble learning
- greedy algorithm
- support vector machine