Genetic Programming over Context-Free Languages with Linear Constraints for the Knapsack Problem: First Results.
Peter BruhnAndreas Geyer-SchulzPublished in: Evol. Comput. (2002)
Keyphrases
- knapsack problem
- linear constraints
- genetic programming
- context free languages
- context free grammars
- optimization problems
- grammatical inference
- context free
- evolutionary algorithm
- fitness function
- evolutionary computation
- optimal solution
- dynamic programming
- regular languages
- exact algorithms
- np hard
- linear programming relaxation
- linear relaxation
- quadratic program
- positive data
- inductive inference
- greedy algorithm
- genetic algorithm
- finite automata
- objective function
- convex sets
- neural network
- decision problems
- linear programming
- search space
- training data