A Novelty-Search Approach to Filling an Instance-Space with Diverse and Discriminatory Instances for the Knapsack Problem.
Alejandro MarreroEduardo SegredoCoromoto LeónEmma HartPublished in: PPSN (1) (2022)
Keyphrases
- knapsack problem
- instance space
- test instances
- test problems
- real valued
- small fraction
- decision trees
- search algorithm
- target concept
- exact algorithms
- optimal solution
- optimization problems
- dynamic programming
- pac learning
- search space
- positive and negative
- np hard
- greedy algorithm
- uniform distribution
- positive examples
- vc dimension
- learning machines
- cost function