Knapsack Secretary Through Boosting.
Andreas AbelsLeon LadewigKevin SchewiorMoritz StinzendörferPublished in: WAOA (2022)
Keyphrases
- knapsack problem
- dynamic programming
- learning algorithm
- ensemble learning
- upper bound
- optimal solution
- feature selection
- cost sensitive
- combining multiple
- information systems
- databases
- packing problem
- randomized trees
- early stopping
- decision tree algorithm
- greedy heuristic
- boosting algorithms
- ensemble methods
- pairwise
- search algorithm
- objective function
- case study