Dynamic algorithm selection for pareto optimal set approximation.
Ingrida SteponaviceRob J. HyndmanKate Smith-MilesLaura VillanovaPublished in: J. Glob. Optim. (2017)
Keyphrases
- optimization algorithm
- np hard
- particle swarm optimization
- dynamic programming
- pareto optimal set
- approximation ratio
- optimal solution
- objective function
- cost function
- search space
- computational complexity
- worst case
- selection algorithm
- knapsack problem
- benchmark problems
- genetic programming
- pareto optimal
- combinatorial optimization
- metaheuristic
- neural network
- learning algorithm