A stochastic approach to handle knapsack problems in the creation of ensembles.
András HajduGyörgy TerdikAttila TibaHenrietta TománPublished in: CoRR (2020)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- optimal solution
- test problems
- optimization problems
- linear programming relaxation
- monte carlo
- bicriteria
- decision trees
- np hard
- np hard problems
- greedy algorithm
- ensemble learning
- continuous relaxation
- exact algorithms
- production planning
- ensemble methods
- upper bound
- implicit enumeration
- evolutionary algorithm