Anytime automatic algorithm selection for knapsack.
Isaías I. HuertaDaniel A. NeiraDaniel A. OrtegaVicente VarasJulio GodoyRoberto Javier Asín AcháPublished in: Expert Syst. Appl. (2020)
Keyphrases
- optimal solution
- dynamic programming
- selection algorithm
- k means
- knapsack problem
- detection algorithm
- objective function
- preprocessing
- optimization algorithm
- greedy heuristic
- learning algorithm
- improved algorithm
- times faster
- tree structure
- ant colony optimization
- worst case
- np hard
- cost function
- computational complexity
- particle swarm optimization
- input data
- experimental evaluation
- convergence rate
- search space
- lower bound
- computationally efficient
- theoretical analysis
- clustering method
- upper bound
- mathematical model
- single pass