Local search for string problems: Brute-force is essentially optimal.

Jiong Guo Danny Hermelin Christian Komusiewicz

Published in: Theor. Comput. Sci. (2014)

Keyphrases

brute force
exhaustive search
combinatorial optimization
optimal solution
decision problems
neural network
search quality
search algorithm
dynamic programming
np complete
benchmark problems
mathematical programming