Beam search for the longest common subsequence problem.

Christian Blum Maria J. Blesa Manuel López-Ibáñez

Published in: Comput. Oper. Res. (2009)

Keyphrases

beam search
branch and bound
larger problems
search algorithm
heuristic search
search methods
search problems
assembly line
ranking functions
hill climbing
production planning and scheduling
keywords
lower bound
domain specific
search strategies
assembly line balancing