Sign in

Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.

Christian BlumMaria J. Blesa
Published in: Appl. Soft Comput. (2018)
Keyphrases
  • beam search
  • timetabling problem
  • np complete problems
  • stochastic local search
  • machine learning
  • information retrieval
  • evolutionary algorithm
  • finding optimal solutions