Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.
Tobias FriedrichJun HeNils HebbinghausFrank NeumannCarsten WittPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- search heuristics
- multi objective
- evolutionary algorithm
- constraint programming
- genetic algorithm
- tabu search
- probabilistic model
- beam search
- search procedures
- mathematical programming
- knapsack problem
- conflicting objectives
- neural network
- search strategies
- genetic programming
- optimization problems
- special case
- information retrieval