An efficient optimizer for the 0/1 knapsack problem using group counseling.
Yazeed Yasin GhadiTamara Al ShloulZahid Iqbal NezamiHamid AliMuhammad AsifHanan AljuaidShahbaz AhmadPublished in: PeerJ Comput. Sci. (2023)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- optimal solution
- optimization problems
- exact algorithms
- np hard
- greedy algorithm
- test problems
- continuous relaxation
- np hard problems
- multidimensional knapsack problem
- linear programming relaxation
- bicriteria
- heuristic solution
- multiple objectives
- greedy heuristic
- decision variables
- implicit enumeration
- optimization algorithm
- linear programming
- objective function
- database systems
- genetic algorithm
- neural network