A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation.
Jonas MayerhoferMarkus KirchwegerMarc HuberGünther R. RaidlPublished in: EvoCOP (2022)
Keyphrases
- beam search
- shortest common supersequence
- branch and bound
- larger problems
- heuristic search
- search algorithm
- assembly line
- search methods
- np hard
- search problems
- hill climbing
- lower bound
- cost function
- data sets
- neural network
- production planning and scheduling
- ranking functions
- simulated annealing
- upper bound
- artificial neural networks