Minimum common string partition: on solving large-scale problem instances.
Christian BlumPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- timetabling problem
- np complete problems
- stochastic local search
- real world
- real life
- randomly generated
- data sets
- closest string
- database
- training instances
- evolutionary algorithm
- small scale
- regular expressions
- combinatorial optimization
- minimum cost
- lower and upper bounds
- context free grammars
- string matching
- pattern matching
- upper bound
- exact methods
- data structure
- training data