Evolutionary-based tailoring of synthetic instances for the Knapsack problem.
Luis Fernando Plata-GonzálezIván AmayaJosé Carlos Ortiz-BaylissSantiago Enrique Conant-PablosHugo Terashima-MarínCarlos A. Coello CoelloPublished in: Soft Comput. (2019)
Keyphrases
- knapsack problem
- linear programming relaxation
- randomly generated test instances
- optimization problems
- dynamic programming
- optimal solution
- combinatorial optimization problems
- test problems
- exact algorithms
- np hard
- genetic algorithm
- greedy algorithm
- multidimensional knapsack problem
- randomly generated
- heuristic solution
- implicit enumeration
- evolutionary computation
- maximum profit
- continuous relaxation
- bicriteria
- np hard problems
- decision variables
- objective function
- greedy heuristic
- learning algorithm
- neural network
- approximation algorithms
- particle swarm optimization