Sign in
Approximating covering problems by randomized search heuristics using multi-objective models.
Tobias Friedrich
Nils Hebbinghaus
Frank Neumann
Jun He
Carsten Witt
Published in:
GECCO (2007)
Keyphrases
</>
search heuristics
multi objective
evolutionary algorithm
genetic algorithm
constraint programming
machine learning
special case
np complete
heuristic search
multi objective optimization
information retrieval
search strategies
knapsack problem
benchmark problems
test problems
branch and bound search