Login / Signup
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem.
Christian Blum
Maria J. Blesa
Published in:
J. Heuristics (2018)
Keyphrases
</>
beam search
case study
artificial intelligence
simulated annealing
metaheuristic
search methods
real world
genetic algorithm
feature selection
artificial neural networks
search space
optimization problems
orders of magnitude
tabu search
optimization method