Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem.
Andrés Cordón-FrancoMiguel A. Gutiérrez-NaranjoMario J. Pérez-JiménezAgustin Riscos-NúñezFernando Sancho-CaparriniPublished in: Workshop on Membrane Computing (2003)
Keyphrases
- knapsack problem
- optimal solution
- implicit enumeration
- combinatorial optimization problems
- greedy heuristic
- linear programming relaxation
- test problems
- heuristic solution
- decision variables
- cutting plane
- continuous relaxation
- np hard
- exact algorithms
- optimization problems
- multidimensional knapsack problem
- lp relaxation
- branch and bound
- integer variables
- dynamic programming
- np hard problems
- expert systems
- lower bound
- maximum profit
- neural network
- greedy algorithm
- linear program
- logic programming
- evolutionary algorithm
- search space
- objective function