Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm.
Khadoudja GhanemAbdesslem LayebPublished in: Int. J. Appl. Evol. Comput. (2021)
Keyphrases
- optimization algorithm
- knapsack problem
- feature selection
- continuous relaxation
- multi objective
- decision variables
- combinatorial optimization problems
- optimization problems
- linear programming relaxation
- optimal solution
- clause learning
- dynamic programming
- test problems
- multidimensional knapsack problem
- particle swarm optimization pso
- np hard
- greedy algorithm
- differential evolution
- optimization strategy
- constraint satisfaction
- multiple objectives
- exact algorithms
- optimization method
- machine learning
- evolutionary multi objective
- control parameters
- maximum profit
- search space
- implicit enumeration
- feature subset
- computational intelligence
- evolutionary algorithm
- search algorithm
- nsga ii
- artificial bee colony
- sat solvers
- special case